Abstract
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.
The work is supported by National Natural Science Foundation of China and NSF of Hubei Province.
Chapter PDF
Similar content being viewed by others
References
K. Carberg and J. Crowcroft. “Building shared trees using a one-to-many joining mechanism”. ACM Computer Communication Review. Jan. 1997, pp. 5–11.
T. Ballardie, P. Francis and J. Crowcroft, “An architecture for scalable inter-domain multicast routing,” ACM SIGCOMM, Sept. 1993, pp. 85–95.
Li Layuan and Li ChunLin, “The QoS routing algorithm for ATM networks,” Computer Communications,NO.3–4, Vol.24,2001, pp. 416–421.
Li Layuan. “A formal specification technique for communication protocol”. Proc of IEEE INFOCOM,April. 1989, pp. 7481.
X. Jia. “A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks,” IEEE/ACM Transactions on Networking, No.6, Vo 1.6, Dec. 1998, pp. 828–837.
M. Faloutsos, A. Banerjea, and R. Pankaj, “QoSMIC: Quality of Service sensitive multicast intemet protocol,” SIGCOMM’98. September 1998.
L. Zhang, S. Deering, D. Estrin, S. Shenker, and D. Zappala, “RSVP: A new Resource ReSerVation Protocol,” IEEE Network. Sept. 1993.
Q. Zhu, M. Parsa, and J. J. Garcia-Luna-Aceves, “A source-based algorithm for delay-constrained minimum -cost multicasting,” Proc. IEEE INFOCOM 95, Boston, MA, April 1995.
Y. Xiong and L.G. Mason, “Restoration strategies and spare capacity requirements in self-healing ATM networks,” IEEE Trans on Networks, Vol. 7, No. 1, Feb, 1999, pp. 98–110.
S. Chen and K. Nahrstedt, “Distributed QoS routing in ad-hoc networks,” IEEE JSAC, special issue on ad-hoc networks, Aug. 1999.
Li Laywan. “The routing protocol for dynamic and large computer networks,” Journal of computers, No.2, Vol.11, 1998, PP. 137–144.
B. M. Waxman. “Routing of multipoint connections,” IEEE Journal of Selected Area in Communications, Dec. 1998, pp. 1617–1622.
R. G. Busacker and T. L. Saaty, Finite Graphs and Networks: An introduction with applications, McGraw-Hill, 1965.
Li Layuan and Li Chunlin, “A routing protocol for dynamic and large computer networks with clustering topology,” Computer Communication,No.2, Vol. 23, 2000, pp. 171–176.
D. G. Thaler and C. V. Ravishankar, “Distributed center-location algorithms,” IEEE JSAC, Vol. 15, April 1997, pp. 291–303.
I. Cidon, R. Rom, and Y. Shavitt, “Multi-path routing combined with resource reservation,” IEEE INFOCOM’97. April 1997,pp. 92–100.
J. Mog. “Multicast routing exeensions to OSPF,” RFC 1584. march. 1994.
Li Layuan and Li Chunlin, “The QoS-based routing algorithms for high-speed networks.” Proc of WCC, Aug. 2000, pp 1623–1628.
Roch A. Guerin and Ariel Orda, “QoS routing in networks with inaccurate information: Theory and algorithms,” IEEE/ACM Trans. On Networking, No.3, Vol.7. June. 1999. pp. 350–363.
Bin Wang and Jennifer C. Hou, “Multicast routing and its QoS extension: Problems, algorithms, and protocols,” IEEE Network, Jan/Feb, 2000. pp. 22–36.
Li layuan and Li Chunlin, Computer Networking, National Defence Industry Press, Beijing, 2001.
Moses Charikar, Joseph Naor and Baruch Schieber, Resoutce optimization in QoS multicast routing of real-time multimedia, Proc of JEEE INFOCOM. 2000. pp. 1518–1527.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Li, L., Li, C. (2002). A Multicast Routing Protocol with Multiple QoS Constraints. In: Chapin, L. (eds) Communication Systems. IFIP WCC TC6 2002. IFIP — The International Federation for Information Processing, vol 92. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35600-6_8
Download citation
DOI: https://doi.org/10.1007/978-0-387-35600-6_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-4809-3
Online ISBN: 978-0-387-35600-6
eBook Packages: Springer Book Archive