A tabu search heuristic for the offline MPLS reduced complexity layout design problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3042, Issue , 2004, Pages 514-525

  Beker, Sergio ^a   Puech, Nicolas ^a   Friderikos, Vasilis ^a  

^a TELECOM PARISTECH   (France)

Author keywords

Layout complexity; LSP; MINLP; MPLS; Multicommodity flow; Tabu search; Traffic engineering

Indexed keywords

HEURISTIC ALGORITHMS; INTEGER PROGRAMMING; LINEAR PROGRAMMING; NONLINEAR PROGRAMMING; OPTIMIZATION; QUALITY OF SERVICE; TABU SEARCH;

LAYOUT COMPLEXITY; LSP; MINLP; MPLS; MULTI-COMMODITY FLOW;

COMPLEX NETWORKS;

EID: 35048875212     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24693-0_43     Document Type: Article

References (16)

1. D. Adwuche, G. Malcom, J. Agogbua, M. O'Dell, and J. McManus. Requirements for traffic engineering over MPLS. RFC 2702, IETF, 1999.
2. B. Fortz and M. Thorup. Internet traffic engineering by optimizing OSPF weights. In Volume 2, p.519-528, INFOCOM 2000, 2000. IEEE.
3. R. Ahuja, T. Magnanti, and J. Orlin. Network Flows: Theory, Alogorithms and Applications. Prentice Hall Inc., 1993.
4. D. Katz, D. Yeung, and K. Kompella. Traffic engineering extensions to OSPF version 2. Draft, IETF, 2002.
5. M. Kodialam and T. Lakshman. Minimum interference routing with applications to MPLS traffic engineering. In Volume 2, p.884-893, INFOCOM 2000, 2000. IEEE.
6. G. Banerjee and D. Sidhu. Path computation for traffic engineering in MPLS networks. ICN 2001, 2001. IEEE.
7. S. Beker, D. Kofman, and N. Puech. Off-line reduced complexity layout design for MPLS networks. In Proceedings of IP Operations and Management, IPOM 2003, 2003. IEEE.
8. S. Kirkpatrick, C.D. Jr. Gelatt, and M.P. Vecchi. Optimization by simulated annealing. Science, (4598), 1983.
9. G. Gazen and C. Ersoy. Genetic algorithms for designing multihop lightwave network topologies. Artificial Intelligence in Engineering, 13:211-221, 1999.
10. F. Glover and M. Laguna. Tabu Search. Kluwer Academic Publishers, Boston, MA, 1997.
11. N. Puech, J. Kuri, and M. Gagnaire. Models for the logical topology design problem. In Proceedings of the 2nd IFIP-TC6 Networking Conference. SpringerVerlag, May 2002.
12. S. Beker. Thesis: Optimization Techniques for the Dimensioning and Reconfiguration of MPLS Networks. Telecom Paris, 2004 (to appear).
13. Réseau national de reherche en télécommunications. Technical report, Ministere de l'Economie, des Finances et de l'Industrie de France, 2000-2004. www.vthd.org.
14. D. Banerjee and B. Mukherjee. Wavelength-routed optical networks: Linear formulation, resource budgeting tradeoffs, and a reconfiguration study. Networking, IEEE/ACM Transactions on, 8(5):598-607, 2000.
15. R. Fletcher and S. Leyffer. Numerical experience with lower bounds for MIQP branch and bound. SIAM Journal of Optimization, 8(2):604-616, 1998.
16. J. Czyzyk, M. Mesnier, and J. More. The Neos Server. IEEE Journal on Computational Science and Engineering, 5:68-75.