An adaptive membership management algorithm for application layer multicast

Rong, B, Khalil, I and Tari, Z 2006, 'An adaptive membership management algorithm for application layer multicast', in P. Dini, C. Popoviciu, C. Dini, G. Lambert, G. V. de Velde, N. Pitatla and I. Jayasumana (ed.) Proceedings of the International Conference on Networking and Services (ICNS 2006), Silicon Valley, USA, 16-18 July 2006, pp. 35-35.


Document type: Conference Paper
Collection: Conference Papers

Attached Files
Name Description MIMEType Size
n2006001949.pdf Published version application/pdf 126.38KB
Title An adaptive membership management algorithm for application layer multicast
Author(s) Rong, B
Khalil, I
Tari, Z
Year 2006
Conference name International Conference on Networking and Services
Conference location Silicon Valley, USA
Conference dates 16-18 July 2006
Proceedings title Proceedings of the International Conference on Networking and Services (ICNS 2006)
Editor(s) P. Dini
C. Popoviciu
C. Dini
G. Lambert
G. V. de Velde
N. Pitatla
I. Jayasumana
Publisher IEEE
Place of publication Piscataway, USA
Start page 35
End page 35
Total pages 1
Abstract Due to deployment difficulty of network layer multicast, application layer multicast is considered to be a good substitute for massive P2P video/audio streaming in large networks. However, in application layer multicast, the participating users join and leave the on-going session at will. Therefore, a scalable and reliable group membership management algorithm is necessary due to the highly dynamic nature of the overlay network, built on top of the Internet. Gossip-based algorithms seem to be a solution. However, most gossip-based membership management algorithms lack flexibility, and are unable to adapt to the everchanging network dynamics, imposing roughly the same amount of overhead on the network. A new adaptive gossip-based membership management algorithm is proposed to bridge the gap. This algorithm captures the changes of the network and adjusts the parameter settings dynamically, bringing adaptivity and reducing overhead. Simulation results indicate a maximum of 50% reduction can be achieved in terms of network overhead on core network components, such as backbone links and attached routers, without sacrificing reliability and scalability
Subjects Computer Communications Networks
Keyword(s) application
algorithms
multicast layer
networks
DOI - identifier 10.1109/ICNS.2006.22
Copyright notice © 2006 IEEE
ISBN 0-7695-2622-5
Versions
Version Filter Type
Altmetric details:
Access Statistics: 199 Abstract Views, 223 File Downloads  -  Detailed Statistics
Created: Wed, 08 Apr 2009, 09:42:32 EST by Catalyst Administrator
© 2014 RMIT Research Repository • Powered by Fez SoftwareContact us