A survey and comparison of peer-to-peer overlay network schemes

  title={A survey and comparison of peer-to-peer overlay network schemes},
  author={Eng Keong Lua and Jon Crowcroft and Marcelo Rita Pias and Ravi Sharma and Steven Lim},
  journal={IEEE Communications Surveys \& Tutorials},
Over the Internet today, computing and communications environments are significantly more complex and chaotic than classical distributed systems, lacking any centralized organization or hierarchical control. There has been much interest in emerging Peer-to-Peer (P2P) network overlays because they provide a good substrate for creating large-scale data sharing, content distribution, and application-level multicast applications. These P2P overlay networks attempt to provide a long list of features… 

Figures from this paper

A Survey of Randomized Algorithms in Peer-to-Peer Networks

The general principles of randomized algorithms are studied and their existing applications in peer-to-peer networks are surveyed to find out how these algorithms are used in distributed systems.

Technologies for Search and Data Retrieval in Peer-to-Peer Networks

Peer-to-peer systems are distributed systems in which nodes of equal roles and capabilities exchange information and services directly with each other, offering a mix of various features such as robust wide-area routing architecture, efficient search of data items, selection of nearby peers, redundant storage, permanence, trust and authentication, massive scalability and fault tolerance.

Trust based reliable and secure routing in peer-to-peer overlay networks

The type of peer-to-peer (P2P) current security attacks are reviewed and analyzed, and the Hybrid secure routing mechanism in peertopeer overlay networks is presented to overcome the security challenges.

A survey of P2P overlays in various networks

This paper surveys P2P overlays in various networks such as ad hoc networks, sensor networks and WLANs and potentially offers an efficient routing architecture that is self-organizing, massively scalable, and robust in the wide-area, combining fault tolerance, load balancing and explicit notion of locality.

Peer-to-peer networks

  • Jaydip Sen
  • Computer Science
    2012 3rd National Conference on Emerging Trends and Applications in Computer Science
  • 2012
The term peer-to-peer (P2P) system encompasses a broad set of distributed applications which allow sharing of computer resources by direct exchange between systems and these applications often use these networks to do content poisoning and to distribute harmful programs such as Trojan Horses and viruses.


This work presents a fault-tolerant, cluster-enhanced P2P overlay network designed to share large sets of replicated distributed objects in the context of large-scale highly dynamic infrastructures, whilst providing an adequate consistency among replicas.

Hierarchical architectures in structured peer-to-peer overlay networks

A framework consisting of conceptual models of network hierarchy, multi-layer hierarchical DHT architectures, principles affecting the design choices, and cost models for system tradeoff analysis, performance evaluation, and scalability estimation for structured P2P overlay networks is introduced.

Building self-adaptive Peer-to-Peer overlay networks with dynamic cluster structure

  • Ming XuGuangzhong Liu
  • Computer Science
    2011 IEEE 13th International Conference on Communication Technology
  • 2011
This paper presents a novel approach for improving query routing performance in a fully distributed and self-adaptive way where super-peers can modify their behaviors with incomplete information and bounded rationality for the purpose of improving their individual benefit.

On Designing Overlay Networks for Peer – to – Peer Systems

As this dissertation will argue, P2P is much more than just a way of exchanging MP3s over the Internet, and the chaotic, ad hoc topologies of the first-generation Peer-to-Peer architectures have been replaced by an emergent order, provable properties as well as excellent performance.



Exploiting network proximity in peer-to-peer overlay networks

This paper presents a comprehensive study of the network locality properties of a p2p overlay network, and results obtained via analysis and via simulation of two large-scale topology models indicate that it is possible to efficiently exploit network proximity in self-organizing p2P substrates.

Efficient topology-aware overlay network

Mithos is introduced, an content-addressable overlay network that only uses minimal routing information and is directly suitable as an underlay network for P2P systems, both using traditional and DHT addressing.

Secure routing for structured peer-to-peer overlay networks

This paper studies attacks aimed at preventing correct message delivery in structured peer-to-peer overlays and presents defenses to these attacks, and describes and evaluates techniques that allow nodes to join the overlay, to maintain routing state, and to forward messages securely in the presence of malicious nodes.

Performance and dependability of structured peer-to-peer overlays

This paper presents techniques that continuously detect faults and repair the overlay to achieve high dependability and good performance in realistic environments and shows that previous concerns about the performance and dependability are unfounded.

PAST: a large-scale, persistent peer-to-peer storage utility

The design of PAST is sketched, a large-scale, Internet-based, global storage utility that provides scalability, high availability, persistence and security, and the use of randomization to ensure diversity in the set of nodes that store a file's replicas.

SkipNet: A Scalable Overlay Network with Practical Locality Properties

SkipNet is a scalable overlay network that provides controlled data placement and guaranteed routing locality by organizing data primarily by string names and can result in two disjoint, but well-connected overlay networks.

Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems

Experimental results obtained with a prototype implementation on an emulated network of up to 100,000 nodes confirm Pastry's scalability and efficiency, its ability to self-organize and adapt to node failures, and its good network locality properties.

Pastry: Scalable, distributed object location and routing for large-scale peer-to-

Experimental results obtained with a prototype implementa tion on a simulated network of up to 100,000 nodes confirm Pastry’s scalability, its ability to selfconfigure and adapt to node failures, and its good network loc ality properties.

Scribe: a large-scale and decentralized application-level multicast infrastructure

Simulation results, based on a realistic network topology model, show that Scribe scales across a wide range of groups and group sizes, and balances the load on the nodes while achieving acceptable delay and link stress when compared with Internet protocol multicast.

YAPPERS: a peer-to-peer lookup service over arbitrary topology

This paper proposes a hybrid scheme for building a peer-to-peer lookup service over arbitrary network topology that can reduce the nodes contacted for a lookup by an order of magnitude, allows rapid searching of nearby nodes through quick fan-out, does not reorganize the underlying overlay, and isolates the effect of topology changes to small areas for better scalability and stability.