A multi-constrained multicast QoS routing algorithm

Opposed to the situation that the constrained minimum Steiner tree (CMST) problem has been attracting much attention in quality of service (QoS) routing area, little work has been done on multicast routing subject to multiple additive constraints even though this is required by many emerging applications. In this paper, we propose a heuristic HMCMC to find feasible solutions to this problem. HMCMC has a provably low time complexity, and its basic idea is to construct a multicast tree step-by-step, which is done essentially based on the latest research results on multi-constrained unicast routing. Computer simulations demonstrate that HMCMC can achieve a high success ratio of finding feasible solutions.

[1]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

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

[3]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[4]  Ron Widyono.  The Design and Evaluation of Routing Algorithms for Real-time Channels , 1994 .

[5]  Gang Feng.  The revisit of nonlinear Lagrange relaxation based QoS routing , 2005, IEEE International Conference on Communications, 2005. ICC 2005. 2005.

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

[7]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8]  Fernando A. Kuipers,et al.  A Review of Constraint-Based Routing Algorithms , 2002 .

[9]  Gang Feng.  The revisit of QoS routing based on non-linear Lagrange relaxation , 2007, Int. J. Commun. Syst..

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

[11]  Douglas S. Reeves,et al.  Evaluation of multicast routing algorithms for real-time communication on high-speed networks , 1995 .

[12]  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).

[13]  Anukool Lakhina,et al.  BRITE: Universal Topology Generation from a User''s Perspective , 2001 .

[14]  Niki Pissinou,et al.  Efficient implementations of a delay-constrained least-cost multicast algorithm , 2002, Journal of Communications and Networks.

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

[16]  P. Van Mieghem,et al.  A multiple quality of service routing algorithm for PNNI , 1998 .