Peer-to-peer (P2P) applications are enormously popular on the Internet. Their uses vary from file sharing to Voice–over–IP to gaming and more. Increasingly, users are moving toward wireless networked devices and wish to continue using P2P applications in these new environments. A mobile ad hoc network (MANET) is an infrastructureless network which allows users to dynamically form a mobile, wire...

P eer-to-peer systems are distributed systems that operate without centralized organization or control. To find a particular piece of data within the network, P2P systems explicitly or implicitly provide a lookup mechanism, or locator function, that matches a given string, or key, to one or more network nodes responsible for the value associated with that key. P2P nodes interoperate by using th...

Peer-to-Peer overlay systems offer a substrate for the construction of large scale and distributed applications. The Peer-to-Peer technique is differentiated in to two major forms, Structured P2P and Unstructured P2P. In structured peer-to-peer networks, connections in the overlay are fixed. They typically use distributed hash table-based (DHT) indexing, such as in the Chord system. Unstructure...

The widespread use of recent Peer-to-peer (P2P) file sharing has been mainly influenced by the scalability of their architecture and high versatile search mechanisms. However, most of the P2P networks construct loosely coupled overlay on the top of the internet based on the physical network constraints without taking user preferences or relationship into account. It leads to high inefficiency i...

Due to their minimum consideration to an actual network topology, the existing peer-to-peer (P2P) overlay networks will lead to high latency and low efficiency. In TaChord, we present a study of topology-aware routing approaches in P2P overlays, and present an improved design in Chord. We evaluate TaChord and other algorithms by physical hops, interdomain-adjusted latency, and aggregate bandwid...

Structured P2P overlays provide a framework for building distributed applications that are self-configuring, scalable, and resilient to node failures. Such systems have been successfully adopted in large-scale Internet services such as content delivery networks and file sharing; however, widespread adoption in small/medium scales has been limited due in part to security concerns and difficulty ...

It is difficult to build contents delivery platform over the unstructured P2P network because the traffic generated by P2P clients are unmanageable. By applying percolation theory to propagate newly defined reverse-query messages over the unstructured P2P network, we propose novel contents delivery network architecture built over existing unstructured P2P network. We analyzed our algorithm and ...

Structured peer-to-peer (P2P) lookup services—such as Chord, CAN, Pastry and Tapestry—organize peers into a flat overlay network and offer distributed hash table (DHT) functionality. In these systems, data is associated with keys and each peer is responsible for a subset of the keys. We study hierarchical DHTs, in which peers are organized into groups, and each group has its autonomous intra-gr...

The P2P model has many potential advantages (e.g., large scale, fault-tolerance, low cost of administration and maintenance) due to the design flexibility of overlay networks and the decentralized management of cooperative sharing of information and resources. However, the mismatch between the randomly constructed overlay network topology (combined with its broadcaststyle message forwarding inf...

Almost all current P2P applications are built as monolithic systems: they tightly couple application software with an underlying P2P technology. For simple P2P applications like file sharing of instant messaging this does not represent a deficiency. For more general scenarios, e.g., for providing an electronic market place based on P2P technology, flexibility has to be increased. We propose to ...