A Multicast Routing Protocol with Multiple QoS Constraints

The next generation Internet and high-performance networks are expected to support multicast routing with QoS constraints. To facilitate this, QoS multicast routing protocols are pivotal in enabling new member to join a multicast group. Multicast routing is establishing a tree which is rooted from the source node and contains all the multicast destinations. A multicast routing tree with multiple QoS constraints may be the tree in which the delay, delay jitter, packet loss and bandwidth should satisfy the pre-specified bounds. This paper discusses the multicast routing problem with multiple QoS constraints, which may deal with the delay, delay jitter, bandwidth and packet loss metrics, and describes a network model for researching the routing problem. It presents a multicast routing protocol with multiple QoS constraints (MRPMQ). The MRPMQ attempts to significantly reduce the overhead of constructing a multicast tree with multiple QoS constraints. In MPRMQ, a multicast group member can join or leave a multicast session dynamically, which should not disrupt the multicast tree. It also attempts to minimize overall cost of the tree, and satisfy the multiple QoS constraints and least cost’s (or lower cost) requirements. In this paper, the proof of correctness and complexity analysis of the MRPMQ are also given. Simulation results show that MRPMQ is an available approach to multicast routing decision with multiple QoS constraints.

[1]  Li Layuan,et al.  QoS-based routing algorithms for ATM networks , 2001 .

[2]  Bin Wang,et al.  Multicast routing and its QoS extension: problems, algorithms, and protocols , 2000 .

[3]  L. Layuan,et al.  A routing protocol for dynamic and large computer networks with clustering topology , 2000 .

[4]  Jim Kurose,et al.  Computer Networking , 2000 .

[5]  Joseph Naor,et al.  Resource optimization in QoS multicast routing of real-time multimedia , 2000, IEEE/ACM Transactions on Networking.

[6]  Qing Zhu,et al.  A source-based algorithm for delay-constrained minimum-cost multicasting , 1995, Proceedings of INFOCOM'95.

[7]  Jon Crowcroft,et al.  Building shared trees using a one-to-many joining mechanism , 1997, CCRV.

[8]  Li La.  THE ROUTING PROTOCOL FOR DYNAMIC AND LARGE COMPUTER NETWORKS , 1998 .

[9]  Li Layuan,et al.  The QoS-based routing algorithms for high-speed networks , 2000, WCC 2000 - ICCT 2000. 2000 International Conference on Communication Technology Proceedings (Cat. No.00EX420).

[10]  Ariel Orda,et al.  QoS routing in networks with inaccurate information: theory and algorithms , 1999, TNET.

[11]  Layuan Li.  A formal specification technique for communication protocol , 1989, IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies.

[12]  M. Faloutsos,et al.  QoSMIC: quality of service sensitive multicast Internet protocol , 1998, SIGCOMM '98.

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

[14]  Raphael Rom,et al.  Multi-path routing combined with resource reservation , 1997, Proceedings of INFOCOM '97.

[15]  Klara Nahrstedt,et al.  Distributed quality-of-service routing in ad hoc networks , 1999, IEEE J. Sel. Areas Commun..

[16]  T. L. Saaty,et al.  Finite graphs and networks : an introduction with applications , 1967 .

[17]  David Thaler,et al.  Distributed Center-Location Algorithms , 1997, IEEE J. Sel. Areas Commun..

[18]  Xiaohua Jia,et al.  A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks , 1998, TNET.

[19]  Paul Francis,et al.  Core based trees (CBT) , 1993, SIGCOMM 1993.

[20]  Lorne Mason,et al.  Restoration strategies and spare capacity requirements in self-healing ATM networks , 1999, TNET.

[21]  Michalis Faloutsos,et al.  QoS-aware multicast routing for the internet: the design and evaluation of QoSMIC , 2002, TNET.

[22]  Deborah Estrin,et al.  RSVP: a new resource ReSerVation Protocol , 1993 .