Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ganesh A J, Kermarrec A M, Massoulie L. Peer-to-Peer Membership Management for gossip-based protocols. IEEE Trans. Comp., 2003, 52(2): 139–149
Zhang X Y, Liu J C, Li B. CoolStreaming/DONet: A Data-drivern Overlay Network for Peer-to-Peer Live Media Streaming. In: Proceedings of IEEE. Miami, FL, USA. 2005, 2102–2111
Eugster P, Guerraoui R, Handurukande S. Lightweight probabilistic broadcast. ACM Transactions on Compute Systems, 2003, 21(4):341–374
Eugster P, Guerraou R, Kermarrec A-M. From epidemics to distributed computing. IEEE Computer, 2004, 21(4): 341–374
G. Pandurangan, P. Raghavan, and E. Upfal. Building low-diameter P2P networks. IEEE Journal on Selected Areas in Communications, 2003, 21(6): 995–1002
Stavrou A, Rubenstein D, Sahu S. A lightweight, robust P2P system to handle flash crowds. IEEE Journal on Selected Areas in Communications, 2004, 22(1): 6–17
Kermarrec A-M, Massoulie L, Ganesh A J. Probabilistic reliable dissemination in large-scale systems. IEEE Trans. on Parallel and Distributed Sys, 2003, 14(3): 248–258
Jelasity M, Kowalczyk W, Steen M.van. Newscast computing. Technical Report IR-CS-006, Amsterdam: Department of Computer Science of the Vrije Universiteit, 2003
Tsuchiya T, Kikuno T. On the effects of partial membership knowledge on reliability of gossip-based multicast. In: Proceedings of 10th IEEE Pacific Rim International Symposium, Washington, 2004, 76–83
Tang C, Chang R N, Ward C. GoCast: gossip-enhanced overlay multicast for fast and dependable group communication. In: Proceedings of Dependable Systems and Networks, Yokohama, 2005, 140–149
Igarashi D, Tsuchiya T, Kikuno T. Overlay network topologies for gossip-based multicast. In: Proceedings of the 11th International Conference on Parallel and Distributed Systems (ICPADS’05), 2005, 2–7
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Li, R., Xie, Y., Wen, J. et al. EMMP: a highly efficient membership management protocol. Front. Comput. Sc. China 1, 208–212 (2007). https://doi.org/10.1007/s11704-007-0021-4
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s11704-007-0021-4