A new QoS multicast routing protocol

We mainly present a novel QoS multicast routing protocol. The protocol can operate on top of the unicast routing protocol. It only requires the local state information of the link (or the node), but does not requires any global network state to be maintained. The protocol can significantly reduce the overhead for constructing a multicast tree with QoS constraints. In the protocol, a multicast group member can join or leave the multicast session dynamically. The protocol can search multiple feasible tree branches, and select the optimal or near-optimal branch for connecting the new receiver to the multicast tree if it exists. The proof of correctness and complexity analysis of the protocol are given, and the performance measures of the protocol are evaluated using simulation. The study shows that the proposed protocol provides an available approach to multicast routing with QoS constraints.

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

[2]  Lorne Mason,et al.  Restoration strategies and spare capacity requirements in self-healing ATM networks , 1997, Proceedings of INFOCOM '97.

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

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

[5]  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.

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

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

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

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

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

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

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

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

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

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