Optimization of OSPF Routing in IP Networks
DOI10.1007/978-3-642-02250-0_8zbMath1187.68020OpenAlexW1684039864MaRDI QIDQ3404471
Michał Pióro, Eric Gourdin, Kaj Holmberg, Bernard Fortz, Hakan Ümit, Artur Tomaszewski, Andreas Bley, Olivier Klopfenstein
Publication date: 9 February 2010
Published in: Texts in Theoretical Computer Science. An EATCS Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02250-0_8
heuristicsinteger linear programmingtelecommunication networksECMPOSPFshortest path routingthe internet
Integer programming (90C10) Linear programming (90C05) Network design and communication in computer systems (68M10) Network protocols (68M12)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Increasing internet capacity using local search
- On the extremal structure of an OSPF related cone
- On an instance of the inverse shortest paths problem
- Inverse optimization in high-speed networks
- A genetic algorithm for the weight setting problem in OSPF routing
- Multiobjective design of survivable IP networks
- Speeding Up Dynamic Shortest-Path Algorithms
- Approximability of unsplittable shortest path routing problems
- An Integer Programming Algorithm for Routing Optimization in IP Networks
- Valid cycles: A source of infeasibility in open shortest path first routing
- Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths
- On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- Internet Routing and Related Topology Issues
- Optimization of Internet Protocol network design and routing
- A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
- On open shortest path first related network optimisation problems
- Multi-hour design of survivable classical IP networks
- 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
- Routing and Capacity Optimization for IP Networks
This page was built for publication: Optimization of OSPF Routing in IP Networks
