Complexity International       /vol10/zhengy01/ © Copyright 2000     
Volume 10 Received: 
Accepted: 		 20/06/2000
20/12/2003


A Delay-Constrained Least-Cost Multicast Routing Heuristic for Dynamic Multicast Groups

Zhengying, W. & Bingxin, S.
Abstract
     Many new multimedia applications involve dynamic multiple participants, have stringent end-to-end delay requirement and consume large amount of network resources. In this paper, we propose a new dynamic delay-constrained least-cost multicast routing algorithm (DDCLCMR) to support these applications. When group membership changes, the existing multicast tree is perturbed as little as possible. Simulation results show that DDCLCMR performs very good in terms of cost for both, static and dynamic multicast groups, when compared to the best multicast algorithms known.



 
Full Text
Multimedia Links
(none)

Reference Links
(none)

Citation Reference
Zhengying, W. & Bingxin, S. (2000), A Delay-Constrained Least-Cost Multicast Routing Heuristic for Dynamic Multicast Groups, Complexity International, Submitted preprint under review, Paper ID: zhengy01, URL: http://www.complexity.org.au/ci/vol10/zhengy01/
      Get viewers
for PS & PDF

 Aladdin GhostScript

Adobe Acrobat



 [CI Editor] [Site Manager]