QoS Based Multicast Routing Algorithms for Real Time Applications

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.

[1]  Scott Shenker,et al.  Specification of Guaranteed Quality of Service , 1997, RFC.

[2]  Harrick M. Vin,et al.  Generalized guaranteed rate scheduling algorithms: a framework , 1997, TNET.

[3]  Dilip D. Kandlur,et al.  Provisioning of RSVP-based Services over a Large ATM Network , 1995 .

[4]  George C. Polyzos,et al.  Multicast routing for multimedia communication , 1993, TNET.

[5]  Stephen E. Deering,et al.  Distance Vector Multicast Routing Protocol , 1988, RFC.

[6]  Jon Crowcroft,et al.  Quality-of-Service Routing for Supporting Multimedia Applications , 1996, IEEE J. Sel. Areas Commun..

[7]  Charles L. Hedrick,et al.  Routing Information Protocol , 1988, RFC.

[8]  Jon Crowcroft,et al.  Core Based Trees (CBT) An Architecture for Scalable Inter-Domain Multicast Routing , 1993, SIGCOMM 1993.

[9]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[10]  V. J. Rayward-Smith,et al.  The computation of nearly minimal Steiner trees in graphs , 1983 .

[11]  Ariel Orda,et al.  QoS Routing Mechanisms and OSPF Extensions , 1999, RFC.

[12]  Douglas S. Reeves,et al.  Evaluation of multicast routing algorithms for real-time communication on high-speed networks , 1995 .

[13]  Ariel Orda,et al.  QoS based routing in networks with inaccurate information: theory and algorithms , 1997, Proceedings of INFOCOM '97.

[14]  Deborah Estrin,et al.  The PIM architecture for wide-area multicast routing , 1996, TNET.

[15]  Pawel Winter,et al.  Steiner problem in networks: A survey , 1987, Networks.