User menu

Applications of meta-heuristics to traffic engineering in IP networks

Bibliographic reference Fortz, Bernard. Applications of meta-heuristics to traffic engineering in IP networks. In: International Transactions in Operational Research, Vol. 18, no. 2, p. 131-147 (2011)
Permanent URL
  1. Altın , A. Belotti , P. Pinar , M.Ç. 2006
  2. Altın, Operations Research, 7, 301 (2009)
  3. Altın , A. Fortz , B. Ümit , H. 2008
  4. Applegate David, Cohen Edith, Making intra-domain routing robust to changing and uncertain traffic demands : understanding fundamental tradeoffs, 10.1145/863955.863991
  5. Bean James C., Genetic Algorithms and Random Keys for Sequencing and Optimization, 10.1287/ijoc.6.2.154
  6. Belotti Pietro, Pınar Mustafa Ç., Optimal oblivious routing under linear and ellipsoidal uncertainty, 10.1007/s11081-007-9033-z
  7. Ben-Ameur , W. Gourdin , E. Liau , B. Michel , N. 2000 Proceedings of Networks 2000
  8. Ben-Ameur Walid, Kerivin Hervé, Routing of Uncertain Traffic Demands, 10.1007/s11081-005-1741-7
  9. Bley , A. 2003 Proceedings of the 1st International Network Optimization Conference (INOC 2003), Paris
  10. Buriol L.S., Resende M.G.C., Ribeiro C.C., Thorup M., A hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routing, 10.1002/net.20070
  11. Buriol Luciana S., Resende Mauricio G. C., Thorup Mikkel, Speeding Up Dynamic Shortest-Path Algorithms, 10.1287/ijoc.1070.0231
  12. Ericsson M., Resende M.G.C., Pardalos P.M., 10.1023/a:1014852026591
  13. Fortz B., Rexford J., Thorup M., Traffic engineering with traditional IP routing protocols, 10.1109/mcom.2002.1039866
  14. Fortz , B. Thorup , M. 2000 Proceedings of the 19th IEEE Conference on Computer Communications (INFOCOM) Tel-Aviv
  15. Fortz B., Thorup M., Optimizing OSPF/IS-IS weights in a changing world, 10.1109/jsac.2002.1003042
  16. Fortz, Proceedings of INOC 2003, 225 (2003)
  17. Fortz Bernard, Thorup Mikkel, Increasing Internet Capacity Using Local Search, 10.1023/b:coap.0000039487.35027.02
  18. Fortz , B. Ümit , H. 2010 International Transactions in Operational Research 10.1111/j.1475-3995.2010.00769.x
  19. Holmberg Kaj, Yuan Di, A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem, 10.1287/opre.48.3.461.12439
  20. Cisco Systems Inc., Internetworking Technologies Handbook (2000)
  21. Leduc G., Abrahamsson H., Balon S., Bessler S., D'Arienzo M., Delcourt O., Domingo-Pascual J., Cerav-Erbas S., Gojmerac I., Masip X., Pescapè A., Quoitin B., Romano S.P., Salvadori E., Skivée F., Tran H.T., Uhlig S., Ümit H., An open source traffic engineering toolbox, 10.1016/j.comcom.2005.06.010
  22. Moy, OSPF: Anatomy of an Internet Routing Protocol (1998)
  23. Mulyana , E. Killat , U. 2002
  24. Mulyana, Proceedings of INOC 2005, 695 (2005)
  25. Pióro, Routing, Flow, and Capacity Design in Communication and Computer Networks (2004)
  26. Ramalingam G., Reps Thomas, An Incremental Algorithm for a Generalization of the Shortest-Path Problem, 10.1006/jagm.1996.0046