Cart (Loading....) | Create Account
Close category search window

A gossip-based membership management algorithm for large-scale peer-to-peer media streaming

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Bin Rong ; Sch. of Comput. Sci. & Inf. Technol., R. Melbourne Inst. of Technol., Vic. ; Khalil, I. ; Tari, Z.

A new adaptive gossip-based membership management algorithm is proposed. Its adaptive nature enables it to confine 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

Published in:

Local Computer Networks, 2005. 30th Anniversary. The IEEE Conference on

Date of Conference:

17-17 Nov. 2005

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.