loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l
A Gossip-based Membership Management Algorithm for Large-Scale Peer-to-Peer Media Streaming
Sydney, Australia
November 15-November 17
ISBN: 0-7695-2421-4
ASCII Text
x 
 
Bin Rong, Ibrahim Khalil, Zahir Tari, "A Gossip-based Membership Management Algorithm for Large-Scale Peer-to-Peer Media Streaming," Local Computer Networks, Annual IEEE Conference on, pp. 486-487, The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l, 2005.
 
 
BibTex
x
 
@article{ 10.1109/LCN.2005.7,
author = {Bin Rong and Ibrahim Khalil and Zahir Tari},
title = {A Gossip-based Membership Management Algorithm for Large-Scale Peer-to-Peer Media Streaming},
journal ={Local Computer Networks, Annual IEEE Conference on},
volume = {0},
year = {2005},
issn = {0742-1303},
pages = {486-487},
doi = {http://doi.ieeecomputersociety.org/10.1109/LCN.2005.7},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Local Computer Networks, Annual IEEE Conference on
TI - A Gossip-based Membership Management Algorithm for Large-Scale Peer-to-Peer Media Streaming
SN - 0742-1303
SP486
EP487
A1 - Bin Rong,
A1 - Ibrahim Khalil,
A1 - Zahir Tari,
PY - 2005
KW - null
VL - 0
JA - Local Computer Networks, Annual IEEE Conference on
ER -
 
Bin Rong, RMIT University, Australia
Ibrahim Khalil, RMIT University, Australia
Zahir Tari, RMIT University, Australia

A new adaptive gossip-based membership management algorithm is proposed. Its adaptive nature enables it to con- fine the control overhead to local ranges, and adapt to the ever-changing network traffic conditions and group membership. The random nature of the algorithm ensures that it can cope with random failures and offer proactive measures to maintain service at a certain level. Mathematical analysis and simulation results indicate that more than 90% of the nodes can work properly even under very high network dynamics (with a short half-life time of 50 seconds), and all these are achieved by using a relatively low overhead.

Citation:
Bin Rong, Ibrahim Khalil, Zahir Tari, "A Gossip-based Membership Management Algorithm for Large-Scale Peer-to-Peer Media Streaming," lcn, pp.486-487, The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l, 2005
Usage of this product signifies your acceptance of the Terms of Use.