An Overlay Network Based on Arrangement Graph with Fault Tolerance

As people change the habit of using the Internet, network technology has become matured. Unlike client-server, peer-to-peer (P2P) technology increases the convenience of people’s daily life. The routing efficiency of P2P system without centralized server always is an important issue. This paper proposes a virtual peer mechanism of P2P overlay network based on the arrangement graph to make exiting physical peers be agent peers for vacant peers. Each vacant peer is managed by a physical peer who often is its neighbor, and the vacant peer is called virtual peer. Physical peers and virtual peers make the arrangement graph full, and make the number of routing hops can be limited within the diameter of the arrangement graph. From experimental results, this system can keep routing efficiency no matter the number of peers and do not increase system overhead.

[1]  Yeh-Ching Chung,et al.  Design and analysis of arrangement graph-based overlay systems for information sharing , 2011, 2011 IEEE GLOBECOM Workshops (GC Wkshps).

[2]  Antti Ylä-Jääski,et al.  Adaptive lookup for unstructured peer-to-peer overlays , 2008, 2008 3rd International Conference on Communication Systems Software and Middleware and Workshops (COMSWARE '08).

[3]  Khaled Day,et al.  Arrangement Graphs: A Class of Generalized Star Graphs , 1992, Inf. Process. Lett..

[4]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[5]  S. Krause,et al.  OverSim: A Flexible Overlay Network Simulation Framework , 2007, 2007 IEEE Global Internet Symposium.

[6]  Ion Stoica,et al.  Peer-to-Peer Systems II , 2003, Lecture Notes in Computer Science.

[7]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[8]  Jon Crowcroft,et al.  A survey and comparison of peer-to-peer overlay network schemes , 2005, IEEE Communications Surveys & Tutorials.

[9]  Song Jiang,et al.  LightFlood: Minimizing Redundant Messages and Maximizing Scope of Peer-to-Peer Search , 2008, IEEE Transactions on Parallel and Distributed Systems.

[10]  Gade Krishna,et al.  A scalable peer-to-peer lookup protocol for Internet applications , 2012 .

[11]  David R. Karger,et al.  Koorde: A Simple Degree-Optimal Distributed Hash Table , 2003, IPTPS.