EMMP: a highly efficient membership management protocol

Gossip (or epidemic) algorithms have recently become popular solutions to multicast message dissemination in peer-to-peer systems. Nevertheless, it is not straightforward to apply gossip to on-demand streaming because it often fails to achieve a timely delivery. To solve this problem and taking into account the characteristic of peers randomly joining and leaving in peer-to-peer systems, an Efficient Membership Management Protocol (EMMP) has been presented. Every node only needs to keep contact with O (log(N)) nodes, and EMMP can support the reliable dissemination of messages. Considering the “distance” between peers, it causes the major data to be transmitted in a local area and reduces the backbone’s traffic, and speeds up the dissemination of messages between peers. This paper has adopted the “goodfriend” mechanism to reduce the influence on the system when a peer fails or leaves. Simulation results show that EMMP is highly efficient, and both the redundancy and the delay of the system are well solved.

[1]  Eli Upfal,et al.  Building low-diameter peer-to-peer networks , 2003, IEEE J. Sel. Areas Commun..

[2]  Bo Li,et al.  CoolStreaming/DONet: a data-driven overlay network for peer-to-peer live media streaming , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[3]  Tatsuhiro Tsuchiya,et al.  Overlay network topologies for gossip-based multicast , 2005, 11th International Conference on Parallel and Distributed Systems (ICPADS'05).

[4]  Dan Rubenstein,et al.  A lightweight, robust P2P system to handle flash crowds , 2004, IEEE J. Sel. Areas Commun..

[5]  Eli Upfal,et al.  Building low-diameter P2P networks , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[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]  Anne-Marie Kermarrec,et al.  Peer-to-Peer Membership Management for Gossip-Based Protocols , 2003, IEEE Trans. Computers.

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

[9]  Tatsuhiro Tsuchiya,et al.  On the effects of partial membership knowledge on reliability of gossip-based multicast , 2004, 10th IEEE Pacific Rim International Symposium on Dependable Computing, 2004. Proceedings..

[10]  Anne-Marie Kermarrec,et al.  From Epidemics to Distributed Computing , 2004 .

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