Optimization of OSPF routing in IP networks
DOI10.1007/978-3-642-02250-0_8zbMATH Open1187.68020OpenAlexW1684039864MaRDI QIDQ3404471FDOQ3404471
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
Recommendations
- On open shortest path first related network optimisation problems
- Increasing internet capacity using local search
- Survivable IP network design with OSPF routing
- A genetic algorithm for the weight setting problem in OSPF routing
- Compatible weights and valid cycles in non-spanning OSPF routing patterns
heuristicsinteger linear programmingECMPOSPFshortest path routingtelecommunication networksthe internet
Linear programming (90C05) Integer programming (90C10) Network design and communication in computer systems (68M10) Network protocols (68M12)
Cites Work
- Title not available (Why is that?)
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- An Incremental Algorithm for a Generalization of the Shortest-Path Problem
- Title not available (Why is that?)
- A genetic algorithm for the weight setting problem in OSPF routing
- Title not available (Why is that?)
- On an instance of the inverse shortest paths problem
- A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing
- A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
- Increasing internet capacity using local search
- Optimization of Internet Protocol network design and routing
- Approximability of unsplittable shortest path routing problems
- On open shortest path first related network optimisation problems
- Routing and Capacity Optimization for IP Networks
- Multiobjective design of survivable IP networks
- Speeding up dynamic shortest-path algorithms
- 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
- Internet Routing and Related Topology Issues
- Title not available (Why is that?)
- Inverse optimization in high-speed networks
- Route optimization in IP networks
- Multi-hour design of survivable classical IP networks
- On the extremal structure of an OSPF related cone
- On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem
- Title not available (Why is that?)
- Compatible weights and valid cycles in non-spanning OSPF routing patterns
- An Integer Programming Algorithm for Routing Optimization in IP Networks
Cited In (14)
- Survivable IP network design with OSPF routing
- Title not available (Why is that?)
- An integer programming algorithm for routing optimization in IP networks
- An Integer Programming Algorithm for Routing Optimization in IP Networks
- Intra-domain traffic engineering with shortest path routing protocols
- Route optimization in IP networks
- An enhanced Benders decomposition method for unique shortest path routing
- Optimization of Internet Protocol network design and routing
- Increasing internet capacity using local search
- Title not available (Why is that?)
- On open shortest path first related network optimisation problems
- Valid cycles: A source of infeasibility in open shortest path first routing
- Computational Science – ICCS 2005
- Better alternatives to OSPF routing
Uses Software
This page was built for publication: Optimization of OSPF routing in IP networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3404471)
