CMTVD: a cost-minimized multicast routing algorithm for heterogeneous applications in ATM networks

Sunhee Yang; Bongtae Kim; Taesoo Jeong

doi:10.1117/12.290452

6 October 1997 CMTVD: a cost-minimized multicast routing algorithm for heterogeneous applications in ATM networks

Sunhee Yang, Bongtae Kim, Taesoo Jeong

Proceedings Volume 3233, Broadband Networking Technologies; (1997) https://doi.org/10.1117/12.290452
Event: Voice, Video, and Data Communications, 1997, Dallas, TX, United States

Abstract

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.

Citation Download Citation

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); https://doi.org/10.1117/12.290452

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available