Evaluation of constrained multicast routing algorithms for real-time communication on high-speed networks

Abstract

Multicast (MC) routing algorithms capable of satisfying the quality of service (QoS) requirements of real-time applications will be essential for future high-speed networks. I 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 trees it generates and its efficiency in managing the network resources. Simulation results over random networks show that constrained algorithms are capable of fulfilling the QoS requirements of real-time applications in wide-area networks. There are studied the performances of tree constrained Steiner tree (CST) heuristics, KPP, CAO, and BSMA, and one constrained shortest path tree (CSPT) heuristic. The cost performance of the heuristics varies. BSMA's MC trees are lower in cost than all other constrained heuristics.