Recursive Distributed Rendezvous (ReDiR) is a service discovery mechanism for Distributed Hash Table (DHT) based Peer-to-Peer (P2P) overlay networks. One of the major P2P systems that has adopted ReDiR is Peer-to-Peer Session Initiation Protocol (P2PSIP), which is a distributed communication system being standardized in the P2PSIP working group of the Internet Engineering Task Force (IETF). In ...

Efficient storage and handling of data stored in a peer-to-peer (P2P) network, proves vital for various applications such as query processing and data mining. This paper presents a distributed, scalable and robust layered overlay (L-overlay) to index and manage multidimensional data in a dynamic P2P network. The proposed method distinguishes between the data and peer layers, with efficient mapp...

Efficient content distribution is one of the emerging applications in vehicular networks. To provide scalable content distribution in vehicular networks, Chord peer-to-peer overlay could be applied. Most P2P protocols, including Chord, are designed for wired-line network, and might perform poorly in mobile networks. Mobile Chord (MChord) is proposed to enhance the P2P performance over vehicular...

Recently there has been significant research focus on distributed computing network massively caching and replica placement problems for content distribution in globally. Peer-to-Peer (P2P) network provides dynamically decentralized, self organized, scalable objects in distributed computing system. However such networks suffer from high latency, network traffic and cache update problems. The ex...

Despite recent excitement generated by the P2P paradigm and despite surprisingly fast deployment of some P2P applications, there are few quantitative evaluations of P2P systems behavior. Due to its open architecture and achieved scale, Gnutella is an interesting P2P architecture case study. Gnutella, like most other P2P applications, builds at the application level a virtual network with its ow...

In one of the latest developments in Grid Computing Peer-to-Peer (P2P) networks have become fashionable for the Grid system architecture. The current implementations are either Data Grids or CPU sharing Grids. In this paper we begin to investigate how a P2P network can behave as CPU sharing Grid. In our model the nodes of the network are very simple and either require or offer service for the e...

In recent years, research efforts tried to exploit peer-to-peer (P2P) systems in order to provide Live Streaming (LS) and Video-on-Demand (VoD) services. Most of these research efforts focus on the development of distributed P2P block schedulers for content exchange among the participating peers and on the characteristics of the overlay graph (P2P overlay) that interconnects the set of these pe...

Most hash-based structured peer-to-peer (HS-P2P) architectures proposed previously focus on stationary peer nodes. When peers move to new locations in the network, these schemes become cumbersome and inefficient in delivering messages. This paper proposes a mobile HS-P2P architecture, called Bristle, which allows nodes to move freely. A node can disseminate its location information through the ...

Built upon overlay topologies, Peer-to-Peer (P2P) networks behave in an ad-hoc way, conduct application-layer routing, enable usercustomized decentralized resources sharing, and thus can be taken as an emerging representative of Active Networks. An important problem in current unstructured P2P networks is that, however, existing searching mechanisms do not scale well because they are either bas...

In addition to the peer/data organization and search algorithm, the overlay network topology (logical connectivity graph) among peers is a crucial component in unstructured peer-to-peer (P2P) networks. Its topological characteristics significantly affect the efficiency of a search on such unstructured P2P networks. Scale-free (power-law) overlay network topologies are one type of the structures...