Optimization of OSPF routing in IP networks
From MaRDI portal
Publication:3404471
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
Cites work
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 1312984 (Why is no real title available?)
- scientific article; zbMATH DE number 1341907 (Why is no real title available?)
- scientific article; zbMATH DE number 1532269 (Why is no real title available?)
- scientific article; zbMATH DE number 2150800 (Why is no real title available?)
- A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
- A genetic algorithm for the weight setting problem in OSPF routing
- A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing
- An Incremental Algorithm for a Generalization of the Shortest-Path Problem
- An Integer Programming Algorithm for Routing Optimization in IP Networks
- Approximability of unsplittable shortest path routing problems
- Compatible weights and valid cycles in non-spanning OSPF routing patterns
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths
- Increasing internet capacity using local search
- Internet Routing and Related Topology Issues
- Inverse optimization in high-speed networks
- Multi-hour design of survivable classical IP networks
- Multiobjective design of survivable IP networks
- On an instance of the inverse shortest paths problem
- On open shortest path first related network optimisation problems
- On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem
- On the extremal structure of an OSPF related cone
- Optimization of Internet Protocol network design and routing
- Route optimization in IP networks
- Routing and capacity optimization for IP networks
- Speeding up dynamic shortest-path algorithms
- Valid cycles: A source of infeasibility in open shortest path first routing
Cited in
(25)- Survivable IP network design with OSPF routing
- An integer programming algorithm for routing optimization in IP networks
- Linear programming models for traffic engineering in 100\% survivable networks under combined IS-IS/OSPF and MPLS-TE
- scientific article; zbMATH DE number 1950494 (Why is no real title available?)
- Internet routing between autonomous systems: fast algorithms for path trading
- An Integer Programming Algorithm for Routing Optimization in IP Networks
- Priority-Based Genetic Algorithm for Shortest Path Routing Problem in OSPF
- On the complexity of equal shortest path routing
- Intra-domain traffic engineering with shortest path routing protocols
- Route optimization in IP networks
- Design of mixed MPLS/OSPF routing in IP networks
- Constrained rerouting in networks: an integer programming formulation
- An enhanced Benders decomposition method for unique shortest path routing
- Optimization of Internet Protocol network design and routing
- Routing and capacity optimization for IP networks
- Increasing internet capacity using local search
- Routing and capacity optimization for IP networks
- scientific article; zbMATH DE number 1728521 (Why is no real title available?)
- 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
- Compatible weights and valid cycles in non-spanning OSPF routing patterns
- Intra-domain traffic engineering with shortest path routing protocols
- Better alternatives to OSPF routing
- Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty
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)
