Adaptive link recovery scheme for structured peer-to-peer networks under churn

The problem of churn in structured peer-to-peer (P2P) networks is one of important research issues in this area. When churn, continuous coming and going of participating nodes, is arisen, search performance of structured P2Ps is degraded. Under high churn rate, network topology is congested, so link recovery is needed to maintain proper search performance. Generally periodic link recovery is used to recover broken links by churn. In periodic maintenance, link recovery period is important parameter. If it is too high or low compared with churn rate, it is difficult to guarantee consistent QoS. We propose an adaptive link recovery scheme to assure consistent search performance of structured P2Ps. In our scheme, churn rate is estimated by gossip protocol, and then the expected number of failed links, Nf, is derived from it. Each node makes Nf times of attempts to recover invalid links. Simulation results show that our scheme guarantees consistent QoS under various situations.

[1]  Bruno Sericola,et al.  Analytic Study of the Impact of Churn in Cluster-Based Structured P2P Overlays , 2010, 2010 IEEE International Conference on Communications.

[2]  Xiaozhou Li,et al.  Active and Concurrent Topology Maintenance , 2004, DISC.

[3]  John Kubiatowicz,et al.  Handling churn in a DHT , 2004 .

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

[5]  Seif Haridi,et al.  Low-Bandwidth Topology Maintenance for Robustness in Structured Overlay Networks , 2005, Proceedings of the 38th Annual Hawaii International Conference on System Sciences.

[6]  Emmanuelle Anceaume,et al.  PeerCube: A Hypercube-Based P2P Overlay Robust against Collusion and Churn , 2008, 2008 Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems.

[7]  Devavrat Shah,et al.  Gossip Algorithms , 2009, Found. Trends Netw..

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

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

[10]  Johannes Gehrke,et al.  Gossip-based computation of aggregate information , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[11]  Stefan Schmid,et al.  eQuus: A Provably Robust and Locality-Aware Peer-to-Peer System , 2006, Sixth IEEE International Conference on Peer-to-Peer Computing (P2P'06).

[12]  Anne-Marie Kermarrec,et al.  Gossip-based peer sampling , 2007, TOCS.

[13]  Mika Ylianttila,et al.  Performance evaluation of a Kademlia-based communication-oriented P2P system under churn , 2010, Comput. Networks.