By Topic

A scalable, dynamic multicast routing algorithm in ATM networks

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

4 Author(s)
Venkateswaren, R. ; School of EECS, Washington State Univ., Pullman, WA, USA ; Raghavendra, C.S. ; Chen, X. ; Kumar, V.P.

In this paper, we present a scalable dynamic multicast routing algorithm based on a dynamic Steiner tree approach. First, we analyze a hierarchical multicast routing algorithm which introduced the use of core nodes in each peer-group to support multicasting under the private network-network interface (PNNI) framework. Based on this analysis, we conclude that finding near-optimal multicast trees in each peer-group is important. Our proposed algorithm produces improved results by computing better multicast trees within each peer-group. This scheme also eliminates the dependency of core node selection, on the quality of overall multicast tree generated. We compare the two schemes based on simulations on several randomly generated graphs of size ranging from 115 to 170 nodes. Based on these simulations, we show that our algorithm performs 35% better than the hierarchical algorithm. Our algorithm is scalable, allows incorporation of fault-tolerance and can easily be extended to incorporate a QoS criterion in routing

Published in:

Communications, 1997. ICC '97 Montreal, Towards the Knowledge Millennium. 1997 IEEE International Conference on  (Volume:3 )

Date of Conference:

8-12 Jun 1997