By Topic

An efficient distributed QoS based multicast routing algorithm

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
$33 $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)
H. Ural ; Sch. of Inf. Technol. & Eng., Ottawa Univ., Ont., Canada ; Keqin Zhu

This paper proposes an efficient distributed multicast routing algorithm that provides quality of service (QoS) guarantees for real-time applications. It focuses on the delay-constrained minimum cost tree (or constrained Steiner tree) problem; that is, it constructs a multicast tree that not only meets the constrained end-to-end delay requirements but also is the minimum cost multicast tree. Two representative algorithms DKPP and DSPH are MST and SP based heuristics, respectively. The MST based algorithms like DKPP run with a high message and time complexity of O(n3). Furthermore, the MST based algorithms have a very low success rate in constructing a constrained multicast tree especially under tight delay constraints. On the other hand, the SP based algorithms like DSPH have a fatal deficiency; that is, these algorithms will not be able to find a solution if the delay constraint is less than the maximum delay of a cost based shortest path tree. Both types of algorithms try to construct the multicast tree sequentially without taking advantage of the concurrency in a distributed algorithm. This paper proposes an efficient distributed multicast routing algorithm which builds the multicast tree in a concurrent manner rather than in a sequential manner. As a result, the proposed algorithm runs with a very low message and time complexity and has a near zero failure rate in constructing a multicast tree even under tight delay constraints without any limitation on the value of delay constraints

Published in:

Performance, Computing, and Communications Conference, 2002. 21st IEEE International

Date of Conference: