Two algorithms for multi‐constrained optimal multicast routing

Multimedia applications, such as video-conferencing and video-on-demand, often require quality of service (QoS) guarantees from the network, typically in the form of minimum bandwidth, maximum delay, jitter and packet loss constraints, among others. The problem of multicast routing subject to various forms of QoS constraints has been studied extensively. However, most previous efforts have focused on special situations where a single or a pair of constraints is considered. In general, routing under multiple constraints, even in the unicast case is an NP-complete problem. We present in this paper two practical and efficient algorithms, called multi-constrained QoS dependent multicast routing (M_QDMR) and (multicasting routing with multi-constrained optimal path selection (M_MCOP)), for QoS-based multicast routing under multiple constraints with cost optimization. We provide proof in the paper that our algorithms are correct. Furthermore, through extensive simulations, we illustrate the effectiveness and efficiency of our proposals and demonstrate their significant performance improvement in creating multicast trees with lower cost and higher success probability. Copyright © 2003 John Wiley & Sons, Ltd.

[1]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

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

[3]  Ian M. Leslie,et al.  How bad is naive multicast routing? , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[4]  Liang Guo,et al.  QDMR: An efficient QoS dependent multicast routing algorithm , 2000, Journal of Communications and Networks.

[5]  Piet Van Mieghem,et al.  MAMCRA: a constrained-based multicast routing algorithm , 2002, Comput. Commun..

[6]  Marwan Krunz,et al.  Multi-constrained optimal path selection , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

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

[8]  Piet Van Mieghem,et al.  Hop-by-hop quality of service routing , 2001, Comput. Networks.

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

[10]  Marvin A. Sirbu,et al.  Pricing Multicast Communication: A Cost-Based Approach , 2001, Telecommun. Syst..

[11]  Quan Sun,et al.  An efficient delay-constrained multicast routing algorithm , 1998, J. High Speed Networks.

[12]  Anees Shaikh,et al.  Destination-Driven Routing for Low-Cost Multicast , 1997, IEEE J. Sel. Areas Commun..

[13]  Hongsuda Tangmunarunkit,et al.  Scaling of multicast trees: comments on the Chuang-Sirbu scaling law , 1999, SIGCOMM '99.

[14]  Ellis Horowitz,et al.  Fundamentals of Computer Algorithms , 1978 .

[15]  George Markowsky,et al.  A fast algorithm for Steiner trees , 1981, Acta Informatica.