Comparison of dynamic multicast routing algorithms for wide-area packet switched (asynchronous transfer mode) networks
- 19 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1 (0743166X) , 212-219
- https://doi.org/10.1109/infcom.1995.515879
Abstract
This paper compares three dynamic multipoint routing algorithms for wide-area packet switched networks like asynchronous transfer mode (ATM) networks. The three algorithms compared are the greedy algorithm, the source rooted shortest path (SP) algorithm and the geographic spread dynamic multicast (GSDM) routing algorithm. We present simulation results over random graphs that demonstrate the performance of these algorithms. The algorithms are evaluated via a series of multiple simulations in terms of the number of packet copies per node and their (in)efficiency. A near optimal Steiner tree heuristic algorithm called the KMB algorithm is used as a measure of the (in)efficiency of the algorithms.Keywords
This publication has 14 references indexed in Scilit:
- Routing in virtual path based ATM networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Routing multipoint connections using virtual paths in an ATM networkPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Virtual path assignment and virtual circuit routing in ATM networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Minimising packet copies in multicast routing by exploiting geographic spreadACM SIGCOMM Computer Communication Review, 1994
- Multicast routing algorithm for nodal load balancingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Design of a broadcast packet switching networkIEEE Transactions on Communications, 1988
- Nonblocking copy networks for multicast packet switchingIEEE Journal on Selected Areas in Communications, 1988
- A fast algorithm for Steiner treesActa Informatica, 1981
- Random GraphsThe Annals of Mathematical Statistics, 1959
- A note on two problems in connexion with graphsNumerische Mathematik, 1959