A genetic algorithm for the weight setting problem in OSPF routing
From MaRDI portal
Open shortest path first is the most commonly used intra-domain internet routing protocol. Data packets are sent along shortest paths, where traffic may split at nodes with several outgoing links on shortest paths to the destination IP. Shortest paths are claculated according to weights on the links. These weights can be set to balance traffic. A genetic algorithm is presented for the NP-hard problem of setting the weights on the links. The algorithm is compared with other heuristics, particularly a local search heuristic by \textit{B. Fortz} and \textit{M. Thorup} [Comput. Optim. Appl. 29, No. 1, 13--48 (2004; Zbl 1069.90024)] on a real network and and twelve artificial instances.
Recommendations
- A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing
- Increasing internet capacity using local search
- Priority-Based Genetic Algorithm for Shortest Path Routing Problem in OSPF
- On open shortest path first related network optimisation problems
- A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion
Cited in
(46)- Optimal oblivious routing under linear and ellipsoidal uncertainty
- A hybrid primal heuristic for finding feasible solutions to mixed integer programs
- Heuristics for a flowshop scheduling problem with stepwise job objective function
- A parallel multi-population biased random-key genetic algorithm for a container loading problem
- A tabu search algorithm for the routing and capacity assignment problem in computer networks
- Biased random-key genetic algorithms with applications in telecommunications
- The multi-parent biased random-key genetic algorithm with implicit path-relinking and its real-world applications
- Heuristics for the dynamic facility location problem with modular capacities
- Multiobjective design of survivable IP networks
- Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing
- A genetic algorithm for the resource constrained multi-project scheduling problem
- An algorithm for the maximum likelihood problem on evolutionary trees
- A biased random-key genetic algorithm for single-round divisible load scheduling
- A hybrid biased random key genetic algorithm for the quadratic assignment problem
- A Parallel Routing Algorithm for Traffic Optimization
- Self avoiding paths routing algorithm in scale-free networks
- Approximability of unsplittable shortest path routing problems
- Applications of meta-heuristics to traffic engineering in IP networks
- Efficient techniques and tools for intra-domain traffic engineering
- A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion
- A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks
- A biased random-key genetic algorithm for the unequal area facility layout problem
- Optimization of OSPF routing in IP networks
- An Integer Programming Algorithm for Routing Optimization in IP Networks
- Transport optimization on complex networks
- A hybrid biased random key genetic algorithm approach for the unit commitment problem
- On open shortest path first related network optimisation problems
- Finding multiple roots of a box-constrained system of nonlinear equations with a biased random-key genetic algorithm
- Improved efficient routing strategy on scale-free networks
- A Python/C++ library for bound-constrained global optimization using a biased random-key genetic algorithm
- Heuristics for the data arrangement problem on regular trees
- Priority-Based Genetic Algorithm for Shortest Path Routing Problem in OSPF
- A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing
- Routing and capacity optimization for IP networks
- Linear programming models for traffic engineering in 100\% survivable networks under combined IS-IS/OSPF and MPLS-TE
- An integer programming algorithm for routing optimization in IP networks
- scientific article; zbMATH DE number 5061975 (Why is no real title available?)
- Computational Science – ICCS 2005
- Intra-domain traffic engineering with shortest path routing protocols
- Intra-domain traffic engineering with shortest path routing protocols
- A biased random-key genetic algorithm for road congestion minimization
- Designing Reliable IP Networks with an Access/Edge/Core Hierarchical Structure
- Two-stage algorithm for bi-objective black-box traffic engineering
- Biased random-key genetic algorithms: a review
- Increasing internet capacity using local search
- Better alternatives to OSPF routing
This page was built for publication: A genetic algorithm for the weight setting problem in OSPF routing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1610662)
