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

Distributed delay constrained multicast path setup algorithm for high speed networks

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)
Bajaj, R. ; Indian Inst. of Technol., Delhi, India ; Ravikumar, C.P. ; Chandra, S.

The problem of finding an optimal multicast tree in a point to point network translates to the Steiner problem in graphs. Since the Steiner problem is NP complete, heuristic approaches are required for path setup. The problem takes a new dimension in wide area networks, where centralized algorithms are not feasible, and distributed schemes are needed. It is also desirable that node participation for path setup is limited to nodes directly involved in the multicast. An additional requirement that comes from the nature of the applications such as video conferencing that use the multicast support from the network is that of bounded end to end delays along any path from the source to each destination in the multicast tree. We present a heuristic algorithm that ensures delay bounds, is distributed and produces trees that are only slightly more expensive than those produced by centralized algorithms. Further we examine the degradation in performance in case of changing delays along network links (where QoS guarantees on delay are not available), and propose ways of making the tree adaptive to these changes. This dynamic routing approach minimizes resource reservation demands and also makes changing multicast groups permissible

Published in:

High-Performance Computing, 1997. Proceedings. Fourth International Conference on

Date of Conference:

18-21 Dec 1997

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.