By Topic

A scalable multicast protocol for delay-constrained shared multicast tree construction

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

2 Author(s)
Bettahar, H. ; Heudiasyc, Univ. de Technol. de Compiegne, France ; Bouabdallah, A.

In this paper we present a multicast protocol for building and maintaining delay-constrained multicast shared trees (DCMST). Our protocol is based on the search of available delay-constrained multipath to graft a new receiver to the shared tree. The new receiver chooses the most promising route regarding to its available bandwidth. This way we help the equilibrium of charge on the network and we offer better routes for resource reservation. In dynamic source groups the DCMST may need to be frequently updated to satisfy the delay constraint; our protocol incorporates a least-cost updating mechanism. The proposed protocol scales well due to the reduced search phase which is limited to available links only

Published in:

Computers and Communications, 1999. Proceedings. IEEE International Symposium on

Date of Conference:

1999