A Genetic Algorithm for the Weight Setting Problem in OSPF Routing

By M. Ericsson, Maurício Resende, P. Pardalos. Journal of combinatorial optimization, 2002

390 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Oppositional biogeography-based optimization (2009, methodology): “In finance, EC has been employed for bankruptcy [84, 85, 86] and stock predictions [87, 88, 89].”
Music-Inspired Harmony Search Algorithm (2009, methodology): “Studies include HS convergence [1, 7], the ‘stochastic partial derivative’ [20] and a population variance analysis for Harmony Memory [21].”
Increasing Internet Capacity Using Local Search (2004, methodology): “Ericsson et al. [ 14 ] have applied a genetic algorithm Buriol et al. [7] have applied a memetic algorithm.”
Optimizing OSPF/IS-IS weights in a changing world (2002, background): “Cisco's defaults inverse-capacity-weights, and get within a few percent of the best possible with general routing, including MPLS. Similar positive findings have been reported in [6], [14], [21], and [24].”
Routing, flow, and capacity design in communication and computer networks (2004, background): “1 for details on how the ECMP flow allocation works; see also [ERP02]).”
Traffic engineering with traditional IP routing protocols (2002, background): “As discovered recently [25, 26], there are several other meta-heuristics that can be used to find good IGP weight settings.”