Share Email Print

Proceedings Paper

Performance of QoS-based multicast routing algorithms for real-time communication
Author(s): Sanjeev Verma; Rajesh K. Pankaj; Alberto Leon-Garcia
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

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.

Paper Details

Date Published: 10 October 1997
PDF: 11 pages
Proc. SPIE 3231, Performance and Control of Network Systems, (10 October 1997); doi: 10.1117/12.290404
Show Author Affiliations
Sanjeev Verma, Univ. of Toronto (Canada)
Rajesh K. Pankaj, Univ. of Toronto (Canada)
Alberto Leon-Garcia, Univ. of Toronto (Canada)

Published in SPIE Proceedings Vol. 3231:
Performance and Control of Network Systems
Wai Sum Lai; Hisashi Kobayashi, Editor(s)

© SPIE. Terms of Use
Back to Top