Applications of meta-heuristics to traffic engineering in IP networks

DOI10.1111/j.1475-3995.2010.00776.xzbMath1219.90033OpenAlexW1974257405MaRDI QIDQ3087845

Bernard Fortz

Publication date: 17 August 2011

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://dipot.ulb.ac.be/dspace/bitstream/2013/145384/1/ApplicationsofmetaheuristicsPUBPRINT.pdf

zbMATH Keywords

meta-heuristicsshortest path routinginternet traffic engineering

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Approximation methods and heuristics in mathematical programming (90C59) Internet topics (68M11)

Related Items

Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty

Cites Work

• Increasing internet capacity using local search
• Routing of uncertain traffic demands
• Optimal oblivious routing under linear and ellipsoidal uncertainty
• A genetic algorithm for the weight setting problem in OSPF routing
• Speeding Up Dynamic Shortest-Path Algorithms
• Genetic Algorithms and Random Keys for Sequencing and Optimization
• A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
• An Incremental Algorithm for a Generalization of the Shortest-Path Problem
• A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing
• Intra-domain traffic engineering with shortest path routing protocols