By Topic

Cost-delay path selection function for real-time multicast routing

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)
Ng, J.M. ; Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ., Singapore ; Peoy Khee Ng

A critical requirement for multi-party multimedia applications is to generate a multicast tree that has minimal overall network cost and acceptable end-to-end network delay in every path. These two features of the multicast tree are often conflicting in nature and the problem of minimizing the overall network cost in multicast routing is a Steiner tree problem which is known to be NP-complete. Most of the multicasting algorithms use heuristics that will optimize either the cost or the delay; however, the requirements of real-time multimedia applications cannot be satisfied. In this paper, a path selection function taking both the cost and the delay into consideration is proposed. A performance study is carried out by applying the path selection function to existing multicasting algorithms. Our results show that by simply changing the path selection function, the overall cost of the multicast tree can be reduced significantly while satisfying the real-time constraint of the multimedia applications

Published in:

Modeling, Analysis and Simulation of Computer and Telecommunication Systems, 1998. Proceedings. Sixth International Symposium on

Date of Conference:

19-24 Jul 1998