Frontiers of Computer Science in China

, Volume 1, Issue 2, pp 208–212

EMMP: a highly efficient membership management protocol

  • Li Renfa 
  • Xie Yunlong 
  • Wen Jigang 
  • Yue Guangxue 
Review Article

DOI: 10.1007/s11704-007-0021-4

Cite this article as:
Li, R., Xie, Y., Wen, J. et al. Front. Comput. Sc. China (2007) 1: 208. doi:10.1007/s11704-007-0021-4
  • 26 Downloads

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.

Keywords

p2p membership management gossip application layer multicast media streaming 

Copyright information

© Higher Education Press and Springer-Verlag 2007

Authors and Affiliations

  • Li Renfa 
    • 1
  • Xie Yunlong 
    • 1
  • Wen Jigang 
    • 1
  • Yue Guangxue 
    • 1
  1. 1.School of Computer and CommunicationHunan UniversityChangshaChina