RLM: Reliable and Locality-Aware Membership Protocol for Heterogeneous P2P Systems

P2P networks are considered to be the most important development for next generation Internet infrastructure. They always consist of large numbers of cooperative but dynamic member nodes. For these system to be effective, an efficient membership protocol is critical. This paper presents RLM which mainly focuses on locality-aware membership protocol in unreliable and heterogeneous P2P systems. RLM forms member nodes in a ring-based structure. Each node has a neighbor list whose length is proportional to its capacity. Member nodes self-adaptively optimize their neighborhood relations in terms of degree and link latency. To increase robustness, each node also has a successor list that consists of successor nodes down the ring. The successor list is with length of logarithm of the system size on average. Both the neighbor list and successor list are constructed in decentralized ways. Theoretical analysis and intensive simulations have shown the effectiveness of RLM. Specially, while the fault resilience is comparable to that of SCAMP in Ganesh, A.J., et al, (2003), RLM achieves up to 54.5% latency reduction.

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

[2]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[3]  V. Cerný.  Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .

[4]  Anne-Marie Kermarrec,et al.  Lightweight probabilistic broadcast , 2003, TOCS.

[5]  Anne-Marie Kermarrec,et al.  Peer-to-Peer Membership Management for Gossip-Based Protocols , 2003, IEEE Trans. Computers.

[6]  Chunqiang Tang,et al.  GoCast: gossip-enhanced overlay multicast for fast and dependable group communication , 2005, 2005 International Conference on Dependable Systems and Networks (DSN'05).

[7]  Zheng Zhang,et al.  Building topology-aware overlays using global soft-state , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

[8]  Ellen W. Zegura,et al.  How to model an internetwork , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[9]  Stefan Saroiu,et al.  A Measurement Study of Peer-to-Peer File Sharing Systems , 2001 .

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

[11]  Anne-Marie Kermarrec,et al.  Probabilistic Reliable Dissemination in Large-Scale Systems , 2003, IEEE Trans. Parallel Distributed Syst..

[12]  S. Dreyfus,et al.  Thermodynamical Approach to the Traveling Salesman Problem : An Efficient Simulation Algorithm , 2004 .

[13]  Paul Francis,et al.  On Heterogeneous Overlay Construction and Random Node Selection in Unstructured P2P Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.