|
|
|
EMMP: a highly efficient membership management protocol |
| LI Renfa, XIE Yunlong, WEN Jigang, YUE Guangxue |
| School of Computer and Communication, Hunan University, Changsha 410082, China; |
|
|
|
|
Abstract Gossip (or epidemic) algorithms have recently become popular solutions to multicast message dissemination in peer-to-peer systems. Nevertheless, it is not straight-forward 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.
|
|
Issue Date: 05 June 2007
|
|
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
| |
Shared |
|
|
|
|
| |
Discussed |
|
|
|
|
