E. I. Chong, S. Maddila, and S. Morley, On nding single-source single destination k shortest paths, Special Issue ICCI'95, pp.40-47, 1995.

S. Chen and K. Nahrstedt, An Overview of Quality-of-Service Routing for the Next Generation High-Speed Networks: Problems and Solutions, in IEEE Network, Special Issue on Transmission and Distribution of digital Video, pp.64-79, 1998.

S. Chen and K. Nahrstedt, On Finding Multi-Constrained paths, IEEE ICC, 1998.

T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms, 2000.

E. W. Dijkstra, A note on two problems in connexion with graphs, Numerische Mathematik, pp.269-271, 1959.

M. Faloutsos, A. Banerjea, and R. Pankaj, QoSMIC: Quality of Service sensitive Multicast Internet protoCol, ACM SIGCOMM, pp.144-153, 1998.

M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, 1979.

F. Glover, Future paths for integer programming and links to artificial intelligence, Computers & Operations Research, vol.13, issue.5, pp.533-549, 1986.
DOI : 10.1016/0305-0548(86)90048-1

W. Goodridge, W. Robertson, W. J. Phillips, and S. Sivakumar, Heuristic Constraint-Path Routing Decision System, 3rd Annual Communication Networks and Services Research Conference (CNSR'05), 2005.
DOI : 10.1109/CNSR.2005.36

L. Henrique, M. K. Costa, S. Fdida, O. Carlos, and M. B. Duarte, Hop-by-Hop Multicast Routing Protocol, ACM SIGCOMM, pp.249-259, 2001.

A. Juttner, B. Szviatovszki, I. Mecs, and Z. Rajko, Lagrange relaxation based method for the QoS routing problem, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213), 2001.
DOI : 10.1109/INFCOM.2001.916277

X. Jia, Y. Zhang, N. Pissinou, and K. , Makki, A distributed multicast routing protocol for real-time multicast applications, Computer Networks 31, pp.101-110, 1999.

F. A. Kuipers, T. Korkmaz, M. Krunz, and P. , An overview of constraint-based path selection algorithms for QoS routing, IEEE Communications Magazine, vol.40, issue.12, 2002.
DOI : 10.1109/MCOM.2002.1106159

T. Korkmaz, M. Krunz, and S. Tragoudas, An efficient algorithm for finding a path subject to two additive constraints, Computer Communications, vol.25, issue.3, pp.225-238, 2002.
DOI : 10.1016/S0140-3664(01)00358-9

F. Kuipers and P. V. Mieghem, MAMCRA: a constrained-based multicast routing algorithm, Computer Communications, pp.801-810, 2002.
DOI : 10.1016/S0140-3664(01)00402-9

V. P. Kompella, J. C. Pasquale, and G. C. Polyzos, Multicast routing for multimedia communication, IEEE/ACM Transactions on Networking, vol.1, issue.3, pp.286-292, 1993.
DOI : 10.1109/90.234851

F. A. Kuipers and P. Van-mieghem, Conditions that impact the complexity of QoS routing, IEEE/ACM Transactions on Networking, vol.13, issue.4, 2005.
DOI : 10.1109/TNET.2005.852882

P. Van-mieghem and F. A. Kuipers, Concepts of Exact QoS Routing Algorithms, IEEE/ACM Transactions on Networking, vol.12, issue.5, 2004.

P. Mieghem, H. De-neve, and F. A. Kuipers, Hop-by-hop quality of service routing, Computer Networks, vol.37, issue.3-4, pp.407-423, 2001.
DOI : 10.1016/S1389-1286(01)00222-5

H. De-neve and P. Van-mieghem, TAMCRA: a tunable accuracy multiple constraints routing algorithm, Computer Communications, vol.23, issue.7, pp.667-679, 2000.
DOI : 10.1016/S0140-3664(99)00225-X

G. N. Rouskas and I. Baldine, Multicast Routing with End-to-End Delay and Delay Variation Constraints, IEEE JSAC, pp.346-356, 1997.

H. F. Salama, D. S. Reeves, and Y. Viniotis, Evaluation of Multicast Routing Algorithms for Real-Time Communication on High-Speed Networks, IEEE JSAC, vol.15, issue.3, pp.332-345, 1997.

L. Wei and D. Estrin, The Trade-oos of Multicast Trees and Algorithms, Proceedings of the 1994 International Conference on Computer Communications and Networks, pp.17-24, 1994.

B. Wang and J. C. Hou, Multicast Routing and its QoS Extension: Problems, Algorithms and Protocols, IEEE Network, pp.22-36, 2000.

J. Xu, S. Y. Chiu, and F. Glover, Tabu search for dynamic routing communications network design, Telecommunication Systems, vol.8, issue.1, pp.55-77, 1997.
DOI : 10.1023/A:1019149101850

J. Xu, S. Y. Chiu, and F. , Glover Optimizing a Ring-Based Private Line Telecommunication Network using TabooSearch, Management Science, vol.45, issue.3, 1999.

G. Apostolopoulos, D. Willams, S. Kamat, R. Guerin, A. Orda et al., QoS routing mechanisms and OSPF extensions, 1999.
DOI : 10.17487/rfc2676

A. The and . Forum, Private network-to-network interface speciication version 1.1 (PNNI 1.1),af-pnni-0055, p.2, 2002.

B. Ali, Molnn ar & Belghith Contents 1 Introduction 3

M. Qos-routing-problem-speciication and .. , 8 2.2.1 Existing multicast QoS routing problems, 8 2.2.2 New proposal for multicast QoS routing Problem . . . . . . . . . . . 9

.. Mamcra-algorithm, 11 3.1.1 Properties used by Mamcra to reductions, p.11

.. Improved-cycle-reduction-algorithm, 26 5.2.1 Path selection 27 5.2.2 Add a path to the set of multicast paths, p.32