Coping with Structured P2P Network Partitions and Unifications

Structured Peer-to-Peer (P2P) networks are popular for their ability to provide scalability, making them well-suited for large-scale applications. We show that structured P2P networks should be able to cope with network partitions and unifications. In this paper, we present three protocols to address this issue. We present a broadcast protocol (BP), by which each node may launch network partitions and unifications. We evaluate BP for various scenarios and show that it can hold convergence in dynamical conditions. We also present efficient network partition and unification protocols which do not require overlay reconstructions. Each node searches new fingers along the circle rather than simple re-creating them. Compared with present protocols, our protocols perform faster with less cost.

[1]  Seif Haridi,et al.  Dealing with network partitions in structured overlay networks , 2009, Peer-to-Peer Netw. Appl..

[2]  Jianguo Chen,et al.  A Secure Routing Protocol for Peer-to-Peer Network , 2010, J. Convergence Inf. Technol..

[3]  Xu Xiang.  A Flexible Resource Location Protocol for Peer-to-Peer Network , 2010, J. Convergence Inf. Technol..

[4]  Seif Haridi,et al.  Efficient Broadcast in Structured P2P Networks , 2003, IPTPS.

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

[6]  Ruchuan Wang,et al.  P2P Replica-tree based Consistency Maintenance Strategy , 2010, J. Digit. Content Technol. its Appl..

[7]  Seif Haridi,et al.  Handling Network Partitions and Mergers in Structured Overlay Networks , 2007 .

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

[9]  Anwitaman Datta,et al.  Merging Intra-Planetary Index Structures: Decentralized Bootstrapping of Overlays , 2007, First International Conference on Self-Adaptive and Self-Organizing Systems (SASO 2007).

[10]  Seif Haridi,et al.  Self-Correcting Broadcast in Distributed Hash Tables , 2003 .

[11]  Suresh Jagannathan,et al.  Locality in structured peer-to-peer networks , 2006, J. Parallel Distributed Comput..

[12]  Ben Y. Zhao,et al.  Tapestry: a resilient global-scale overlay for service deployment , 2004, IEEE Journal on Selected Areas in Communications.

[13]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM 2001.