DHT-Aid, Gossip-Based Heterogeneous Peer-to-Peer Membership Management

In P2P multicast applications, membership management protocols are the basic utilities. In this context, gossip-based protocols have emerged as attractive ones for that they are highly reliable, scalable and simple. Existing gossip-based membership protocols either ignore the underlying topology and the heterogeneity nature of peer nodes or consume lots of control overhead. In this paper, first, we present a modified scalable membership protocol, MSCAMP, to account for node heterogeneity. Then a DHT-aid, gossip-based heterogeneous peer-to-peer membership protocol, called DIGOM, is proposed. DIGOM groups nearby nodes into clusters and takes advantage of MSCAMP as an intra-cluster membership protocol. A DHT structure is built to aid node subscription and inter-cluster link building. From the theoretical analysis and simulation results, both the inter-and intra-cluster fanout in DIGOM can satisfy the requirements for reliable dissemination. Specially, DIGOM achieves a good quality of load balance and requires no synchronization.

[1]  Desh Ranjan,et al.  Space-Filling Curves and Their Use in the Design of Geometric Data Structures , 1997, Theor. Comput. Sci..

[2]  Karl Aberer,et al.  Updates in highly unreliable, replicated peer-to-peer systems , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

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

[4]  Kenneth P. Birman,et al.  Bimodal multicast , 1999, TOCS.

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

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

[7]  Qixiang Sun,et al.  A gossip-based reliable multicast for large-scale high-throughput applications , 2000, Proceeding International Conference on Dependable Systems and Networks. DSN 2000.

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

[9]  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.

[10]  Robbert van Renesse,et al.  Willow: DHT, Aggregation, and Publish/Subscribe in One Protocol , 2004, IPTPS.

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

[12]  Anne-Marie Kermarrec,et al.  HiScamp: self-organizing hierarchical membership protocol , 2002, EW 10.

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