R. Yavatkar, D. Pendarakis, and R. Guerin, A Framework for Policy-based Admission Control , RFC 2573, 2000.

D. Durham, J. Boyle, R. Cohen, S. Herzog, R. Rajan et al., The COPS (Common Open Policy Service) Protocol, RFC 2748, 2000.

R. Sahita, S. Hahn, K. Chan, and K. Mccloghrie, Framework Policy Information Base, 2003.
DOI : 10.17487/rfc3318

D. Awduche, MPLS and traffic engineering in IP networks, IEEE Communications Magazine, vol.37, issue.12, 1999.
DOI : 10.1109/35.809383

D. Awduche, Requirements for Traffic Engineering Over MPLS, RFC 2702, 1999.
DOI : 10.17487/rfc2702
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.375.7283

R. Callon, A Framework for Multiprotocol Label Switching, Internet Draft, 1999.

B. Jamoussi, Constraint-Based LSP Setup using LDP, RFC 3212, 2002.

D. Awduche, RSVP-TE: Extensions to RSVP for LSP Tunnels, 2001.
DOI : 10.17487/rfc3209
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.636.4176

R. Ahuja, T. Magnanti, and J. Orlin, Network Flows: Theory, Algorithms and Applications, pp.788-801, 1993.

M. Kodialam and T. Lakshman, Minimum interference routing with applications to MPLS traffic engineering, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064), 2000.
DOI : 10.1109/INFCOM.2000.832263
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.108.9377

S. Beker, D. Kofman, and N. Puech, Off-line reduced complexity layout design for MPLS networks, Proceedings of the 3rd IEEE Workshop on IP Operations & Management (IPOM 2003) (IEEE Cat. No.03EX764), pp.99-105
DOI : 10.1109/IPOM.2003.1251230

S. Beker, D. Kofman, and N. Puech, Off-Line MPLS Layout Design and Reconfiguration : Reducing Complexity Under Dynamic Traffic Conditions Proceedings of INOC, pp.61-66, 2003.

J. Czyzyk, M. Mesnier, and J. Moré, The NEOS Server, IEEE Computational Science and Engineering, vol.5, issue.3, pp.68-75
DOI : 10.1109/99.714603

R. Fletcher and S. Leyffer, Numerical Experience with Lower Bounds for MIQP Branch-And-Bound, SIAM Journal on Optimization, vol.8, issue.2, pp.604-616, 1998.
DOI : 10.1137/S1052623494268455
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.3167

J. W. Roberts, Self-Similar Network Traffic and Performance Evaluation, chapter Engineering for Quality of Service, pp.401-420, 2000.

C. Arcome and E. Technique, Economique et Réglamentaire de l'Evolution vers les Réseaux de Nouvelle Génération, Autoritéde R` egulation des Télécommunications

E. Altman, T. Ba¸sarba¸sar, T. Jiménez, and N. Shimkin, Competitive routing in networks with polynomial cost, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064), pp.1586-1593, 2000.
DOI : 10.1109/INFCOM.2000.832557

L. Georgiadis, K. Floros, P. Georgatsos, and S. Sartzetakis, Lexicographically Optimal Balanced Networks, Proceedings IEEE, pp.689-698, 2001.
DOI : 10.1109/tnet.2002.804825
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.23.9845

H. Hsu and F. , Yeang-Sung Lin, Near-Optimal Constrained Routing in Virtual Circuit Networks, Proceedings IEEE, pp.750-756, 2001.

D. Banerjee and B. Mukherjee, Wavelength-Routed Optical Networks: Linear Formulation, Resource Budgeting Tradeoffs, and a Reconfiguration Study, Networking, IEEE/ACM Transactions on, issue.5, pp.598-607, 2000.
DOI : 10.1109/infcom.1997.635140
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.101.3906

G. Banerjee and D. Sidhu, Path Computation for Traffic Engineering in MPLS Networks, Proceedings of IEEE ICN, 2001.
DOI : 10.1007/3-540-47734-9_30

A. Feldman, A. C. Gibert, P. Huang, and W. Willinger, Dynamics of IP Traffic: A Study of the Role of Variability and the Impact of Control, SIGCOM 1999

M. Nabe, M. Murata, and H. Miyahara, Analysis and Modeling of Worldwide Web Traffic for Capacity Dimensioning of Internet Access Lines Performance Evaluation, pp.249-271, 1998.

K. Thompson, G. J. Miller, and R. Wilder, Wide-Area Internet Traffic Patterns and Characterization, IEEE Network, vol.4, issue.2, pp.10-23, 1997.
DOI : 10.1109/65.642356
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.93.65

L. Kleinrock, Queueing systems, 1975.

L. Kleinrock, Queueing systems Computer Applications, 1976.

T. Wang, Global Optimization for Constrained Non Linear Programming, 2001.

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

G. L. Nemhouser and L. A. Walsey, Integer and Combinatorial Optimization, 1988.
DOI : 10.1002/9781118627372

M. A. Marsan, A. Grosso, E. Leonardi, M. Mellia, and A. Nucci, Design of Logical Topologies in Wavelength-Routed IP Networks, pp.423-442, 2002.

R. Fourer, D. M. Gay, and B. W. Kernighan, AMPL: A Modeling Language for Mathematical Programming, pp.4-6, 2003.
DOI : 10.1007/978-3-642-83724-1_12

W. Gropp and J. Moré, Optimization Environments and the NEOS Server, Approximation Theory and Optimization, pp.167-182, 1997.

E. Dolan, The NEOS Server 4.0 Administrative Guide, 2001.
DOI : 10.2172/822567

R. Fletcher and S. Leyffer, User Manual for Filter SQP, Numerical Analysis Report, issue.181, 1998.

W. Ben-ameur, B. Liau, and N. Michel, Routing Strategies for IP Networks, 2001.

S. C. Erbas and R. Mathar, An off-line traffic engineering model for MPLS networks, 27th Annual IEEE Conference on Local Computer Networks, 2002. Proceedings. LCN 2002., pp.166-174, 2002.
DOI : 10.1109/LCN.2002.1181781

M. Pióro and A. Myslek, Topological design of MPLS networks, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270), 2001.
DOI : 10.1109/GLOCOM.2001.965071

D. Bienstock, S. Chopra, O. Guenluek, and C. Y. Tsai, Minimum cost capacity installation for multicommodity network flows, Mathematical Programming, vol.68, issue.1, pp.177-199, 1998.
DOI : 10.1007/BF01581104
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.2430

N. Geary, A. Antonopoulos, E. Drakopoulos, and J. O. Reilly, Analysis of optimisation issues in multi-period DWDM network planning, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213), pp.152-158, 2001.
DOI : 10.1109/INFCOM.2001.916697

B. Fortz and M. Thorup, Internet traffic engineering by optimizing OSPF weights, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064), pp.519-528, 2000.
DOI : 10.1109/INFCOM.2000.832225
URL : https://hal.archives-ouvertes.fr/hal-01255612

F. Ergun, R. Sinha, and L. Zhang, QoS Routing with PerformanceDependent Costs, IEEE INFOCOM, issue.48, 2000.

A. Orda, A. Sprintson, and Q. Routing, The Precomputation Perspective, IEEE INFO- COM, issue.48, pp.128-136, 2000.
DOI : 10.1109/infcom.2000.832181
URL : http://cegroup.ece.tamu.edu/~spalex/pub/conferences/infocom00.pdf

T. Korkmaz and M. Krunz, Multi-constrained optimal path selection, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213), pp.834-843, 2001.
DOI : 10.1109/INFCOM.2001.916274
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.8518

A. Jüttner, B. Szviatovszki, I. Mécs, and Z. Rajkó, 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

A. Goel, K. G. Ramakrishnan, D. Kataria, and D. Logothetis, Efficient computation of delay-sensitive routes from one source to all destinations, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213), pp.854-858, 2001.
DOI : 10.1109/INFCOM.2001.916276

O. K. Gupta and A. Ravindran, Branch and Bound Experiments in Convex Non-Linear Integer Programming, Management Science, vol.5, issue.121, pp.31-1533, 1985.

I. Quesada and I. E. Grossmann, An LP/NLP based branch and bound algorithm for convex MINLP optimization problems, Computers & Chemical Engineering, vol.16, issue.10-11, pp.937-947, 1992.
DOI : 10.1016/0098-1354(92)80028-8

A. M. Geoffrion, Generalized Benders decomposition, Journal of Optimization Theory and Applications, vol.10, issue.4, pp.237-260, 1972.
DOI : 10.1007/BF00934810

M. A. Duran and I. E. Grossmann, An outer-approximation algorithm for a class of mixed-integer nonlinear programs, Mathematical Programming, vol.30, issue.3, pp.307-339, 1986.
DOI : 10.1007/BF02592064

R. Fletcher and S. Leyffer, Solving mixed integer nonlinear programs by outer approximation, Mathematical Programming, vol.22, issue.4, pp.327-349, 1994.
DOI : 10.1007/BF01581153

S. Leyffer, Integrating SQP and branch-and-bound for Mixed Integer Nonlinear Programming, Computational Optimization and Applications, vol.18, issue.3, pp.295-309, 2001.
DOI : 10.1023/A:1011241421041

T. Westerlund and F. Petersson, An extended cutting plane method for solving convex MINLP problems, Computers & Chemical Engineering, vol.19, issue.51, pp.131-136, 1995.
DOI : 10.1016/0098-1354(95)87027-X

S. Kirkpatrick, C. D. Gelatt-jr, and M. P. Vecchi, Optimization by Simulated Annealing, Science Journal, number, vol.4598, issue.52, 1983.
DOI : 10.1142/9789812799371_0035
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.123.7607

C. Gazen and C. Ersoy, Genetic algorithms for designing multihop lightwave network topologies, Artificial Intelligence in Engineering, vol.13, issue.3, pp.211-221, 1999.
DOI : 10.1016/S0954-1810(98)00019-3

N. Puech, J. Kuri, and M. Gagnaire, Models for the Logical Topology Design Problem, Proceedings of the 2nd IFIP-TC6 Networking Conference, 2002.
DOI : 10.1007/3-540-47906-6_24

S. Beker, N. Puech, and V. Friderikos, A Tabu Search Heuristic for the Off-Line MPLS Reduced Complexity Layout Design Problem, IFIP-TC6 Networking Conference, LNCS, vol.5, issue.3, 2004.

J. E. Burns, T. J. Ott, J. M. De-kock, and A. E. Krzesinski, Path selection and bandwidth allocation in MPLS networks, Performance Evaluation, vol.52, issue.2-3
DOI : 10.1016/S0166-5316(02)00177-3

A. Kershenbaum, Telecommunication Design Algorithms, 1993.

L. Fratta, M. Gerla, and L. Kleinrock, The flow deviation method: An approach to store-and-forward communication network design, Networks, vol.1, issue.2, pp.97-133, 1973.
DOI : 10.1002/net.3230030202

M. Lucas, D. Wrege, B. Dempsey, and A. Weaver, Statistical characterization of wide-area IP traffic, Proceedings of Sixth International Conference on Computer Communications and Networks, 1997.
DOI : 10.1109/ICCCN.1997.623349

T. Bonald, S. Oueslati-boulahia, and J. W. Roberts, IP traffic and QoS control: the need for a flow-aware architecture, 2002.

A. Gen¸atagen¸ata and B. Mukherjee, Virtual-Topology Adaptation for WDM Lesh Networks Under Dynamic Traffic, Proceedings IEEE, issue.1, pp.48-56, 2001.

B. Ramamurthy and A. Ramakrishnan, Virtual topology reconfiguration of wavelength-routed optical WDM networks, Globecom '00, IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137), pp.1269-1275, 2000.
DOI : 10.1109/GLOCOM.2000.891340

F. Ricciato, S. Salsano, A. Belmonte, and M. Listanti, Off-line configuration of a MPLS over WDM network under time-varying offered traffic, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, pp.57-65, 2001.
DOI : 10.1109/INFCOM.2002.1019246

W. Ben-ameur and H. Kerivin, Routing of uncertain demands, submitted to, Journal on Operations Research, 2001.

J. F. Labourdette, G. W. Hart, and A. S. Acampora, Branch-exchange sequences for reconfiguration of lightwave networks, IEEE Transactions on Communications, vol.42, issue.10, pp.2822-2832, 1994.
DOI : 10.1109/26.328952

K. Ramakrishnan, S. Floyd, and D. Black, The Addition of Explicit Congestion Notification (ECN) to IP, 2001.
DOI : 10.17487/rfc3168

K. Ishiguro and T. Takada, Traffic Engineering Extensions to OSPF version 3, Draft (draft-ietf-ospf-ospfv3-traffic-01.txt), IETF, 2003.
DOI : 10.17487/rfc5329

S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang et al., Weiss An Architecture for Differentiated Services, 1998.
DOI : 10.17487/rfc2475

J. Wroclawski, The Use of RSVP with IETF Integrated Services, 1997.
DOI : 10.17487/rfc2210

M. Grossglauser and J. Rexford, Passive Traffic Measurement for IP Operations, The Internet as a Large-Scale Complex System (Chapter

A. Feldman, A. Greenberg, C. Lund, N. Reingold, J. Rexford et al., Deriving Traffic Demands for Operational IP Networks: Methododoly and Experience, Proceedings of ACM SIGCOM, 2000.

B. Krithikaivasan, K. Deka, and D. Medhi, Adaptive bandwidth provisioning envelope based on discrete temporal network measurements, IEEE INFOCOM 2004, 2004.
DOI : 10.1109/INFCOM.2004.1354589

K. Papagiannaki, N. Taft, Z. L. Zhang, and C. Diot, Long-term forecasting of Internet backbone traffic: observations and initial models, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428), 2003.
DOI : 10.1109/INFCOM.2003.1208954

S. Srivastava, B. Krithikaivasan, D. Medhi, and M. Pióro, Traffic engineering in the presence of tunneling and diversity constraints: Formulation and lagrangean decomposition approach, Proceedings of 18 th International Teletraffic Congress (ITC18), pp.461-470, 2003.
DOI : 10.1016/S1388-3437(03)80191-9

B. Yaged, Minimum Cost Routing for Dyanamic Network Models, Networks, pp.193-224, 1973.

N. Zadeh, On building minimum cost communication networks over time, Networks, vol.16, issue.1, pp.19-34, 1974.
DOI : 10.1002/net.3230040104