Translator Disclaimer
6 October 1997 CMTVD: a cost-minimized multicast routing algorithm for heterogeneous applications in ATM networks
Author Affiliations +
Proceedings Volume 3233, Broadband Networking Technologies; (1997)
Event: Voice, Video, and Data Communications, 1997, Dallas, TX, United States
We present a cost minimized multicast routing algorithm, referred to as the constrained multicast tree with virtual destination (CMTVD), that can be used for heterogeneous applications in ATM networks. In routing multipoint information flows over ATM VP/VC networks, the algorithm generates near optimal multicast tree T[s, (M)] based on the delay requirements of services, link costs and path overlapping effects for resource saving and QoS satisfying purposes. For the delay sensitive service type, the cost optimized route is the minimum cost Stenier tree (MCST) connecting all the destination nodes, virtual destination nodes and the source node with least costs, subject to the delay along the path being less than the maximum allowable end to end delay. On the other hand for the delay in-sensitive service, the cost optimized multicast route is the MCST connecting all the multicast group with least costs, subject to the traffic load is balanced in the network. The CMTVD algorithm uses the virtual destination node concept in order to find the multicast route that maximizes the overlapping effects of the path between multiple destinations, thus minimizes the number of links and switches used in the multicast communications. The cost performance of CMTVD algorithm is evaluated through computer simulation on random graphs.
© (1997) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Sunhee Yang, Bongtae Kim, and Taesoo Jeong "CMTVD: a cost-minimized multicast routing algorithm for heterogeneous applications in ATM networks", Proc. SPIE 3233, Broadband Networking Technologies, (6 October 1997);


Back to Top