A Multicast Routing Protocol with Multiple QoS Constraints

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.KeywordsMulticast routingprotocolmultiple QoS constraintsQoS routingNP-complete