A genetic algorithm for the weight setting problem in OSPF routing (Q1610662)

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.