10 October 1997 Performance of QoS-based multicast routing algorithms for real-time communication
Author Affiliations +
Proceedings Volume 3231, Performance and Control of Network Systems; (1997) https://doi.org/10.1117/12.290404
Event: Voice, Video, and Data Communications, 1997, Dallas, TX, United States
In recent years, there has been a lot of interest in providing real-time multimedia services like digital audio and video over packet-switched networks such as Internet and ATM. These services require certain quality of service (QoS) from the network. The routing algorithm should take QoS factor for an application into account while selecting the most suitable route for the application. In this paper, we introduce a new routing metric and use it with two different heuristics to compute the multicast tree for guaranteed QoS applications that need firm end-to-end delay bound. We then compare the performance of our algorithms with the other proposed QoS-based routing algorithms. Simulations were run over a number of random networks to measure the performance of different algorithms. We studied routing algorithms along with resource reservation and admission control to measure the call throughput over a number of random networks. Simulation results show that our algorithms give a much better performance in terms of call throughput over other proposed schemes like QOSPF.
© (1997) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Sanjeev Verma, Sanjeev Verma, Rajesh K. Pankaj, Rajesh K. Pankaj, Alberto Leon-Garcia, Alberto Leon-Garcia, } "Performance of QoS-based multicast routing algorithms for real-time communication", Proc. SPIE 3231, Performance and Control of Network Systems, (10 October 1997); doi: 10.1117/12.290404; https://doi.org/10.1117/12.290404

Back to Top