Abstract
Multicast (MC) routing algorithms capable of satisfying the QoS requirements of real-time applications will be essential for future high-speed networks. We compare the performance of all of the important MC routing algorithms when applied to networks with asymmetric link loads. Each algorithm is judged based on the quality of the MC tree it generates and its efficiency in managing the network resources. Simulation results over random networks show that unconstrained algorithms are not capable of fulfilling the QoS requirements of real-time applications in wide-area networks. One algorithm, reverse path multicasting, is not suitable for asymmetric networks irrespective of the requirements of the application. The three constrained Steiner tree (CST) heuristics reported to date are also studied. Simulations show that all three heuristics behave similarly and that they can manage the network efficiently and construct low cost MC trees that satisfy the QoS requirements of real-time traffic. The execution times of the CST heuristics depend on the MC group size, but they are always larger than those of the unconstrained algorithms.
This work was supported in part by the Center for Advanced Computing and Communication at North Carolina State University, by Air Force Office of Scientific Research grant F49620-92-J-0441DEF, and by IBM SUR project #1429.
Chapter PDF
Similar content being viewed by others
Keywords
References
Bertsekas, D. and Gallager, R.G. (1992) Data Networks. Second Edition, Prentice-Hall. Deering, S. and Cheriton, D. (1990) Multicast Routing in Datagram Networks and Extended LANs. ACM Transactions on Computer Systems, 8, 85–110.
Deering, S. et. al. (1995) Protocol Independent Multicast (PIM): Protocol Specification. Internet Draft.
Doar, M. and Leslie, I. (1993) How Bad is Naive Multicast Routing. Proceedings of INFOCOM, 82–9.
Kompella, V.P., Pasquale, J.C. and Polyzos, G.C. (1993) Multicast Routing for Multime-dia Communication. IEEE/ACM Transactions on Networking, 1, 286–92.
Kou, L., Markowsky, G. and Berman, L. (1981) A Fast Algorithm for Steiner Trees. Acta Informatica, 15, 141–5.
Macedonia, M.R. and Brutzman, D.P. (1994) MBone Provides Audio and Video Across the Internet. IEEE Computer, 27, April, 30–6.
Moy, J. (1992) Multicast Extension to OSPF. Internet Draft.
Prim, R.C. (1957) Shortest Connection Networks and Some Generalizations. The Bell Systems Technical Journal, 36, 1389–401.
Salama, H.F., Reeves, D.S., Viniotis, I. and Sheu, T.L. (1994) Comparison of Multicast
Routing Algorithms for High-Speed Networks. IBM Technical Report IBM-TR29.1930. Waters, A.G. (1994) A New heuristic for ATM Multicast Routing. Proceedings of the 2nd
IFIP Workshop on Performance Modeling and Evaluation of ATM Networks,8.1–9. Waxman, B.M. (1988) Routing of Multipoint Connections. IEEE Journal on SelectedAreas in Communications,6 1617–22.
Widyono, R. (1994) The Design and Evaluation of Routing Algorithms for Real-Time Channels. Technical Report TR-94–024, Tenet Group, Department of EECS, University of California at Berkeley.
Winter, P. (1987) Steiner Problem in Networks: A Survey. Networks, 17, 129–67.
Zhu, Q., Parsa, M. and Garcia-Luna-Aceves, J.J. (1995) A Source-Based Algorithm for Near-Optimum Delay-Constrained Multicasting. Proceedings of INFOCOM, 377–85.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Salama, H.F., Reeves, D.S., Viniotis, Y., Sheu, TL. (1995). Evaluation of Multicast Routing Algorithms for Real-Time Communication on High-Speed Networks. In: Puigjaner, R. (eds) High Performance Networking. HPN 1995. IFIP — The International Federation for Information Processing. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-34949-7_3
Download citation
DOI: https://doi.org/10.1007/978-0-387-34949-7_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-5399-8
Online ISBN: 978-0-387-34949-7
eBook Packages: Springer Book Archive