Session: Telecommunications II
Survivable Network Design with OSPF Routing
Luciana S. Buriol 1*
Mauricio G.C. Resende 2
Mikkel Thorup 2
Post Doctoral at the Department of Computer and Systems Science
University of Rome "La Sapienza"
Via Salaria, 113 - 2nd floor - room 247, 00198 Rome, Italy
AT&T Labs Research, Room C241
180 Park Avenue, P. O. Box 971, Florham Park, NJ 07932-0971 USA
Internet protocol (IP) traffic follows rules established by routing protocols. Shortest path first
protocols, such as Open Shortest Path First (OSPF), direct traffic based on link weights assigned
by the network operator. Each router computes shortest paths and creates destination table s used
for routing flow on the shortest paths. If a router has multiple outgoing links on shortest paths to
a given destination, it splits traffic evenly over these links. It is also the role of the routing
protocol to specify how the network should react to changes in the network topology, such as
link or router failures. In such situations, IP traffic is re-routed through the shortest paths not
traversing the affected part of the network. This talk addresses the issue of assigning OSPF
weights and multiplicities to each link, aiming to design efficient OSPF-routed networks with
minimum total link multiplicity needed to route the required demand and handle any single (link
or router) failure. The multiplicities are limited to a discrete set of values and we assume that the
topology is given. We propose an evolutionary algorithm for this problem, and present results
applying it to two real-world problem instances.
* Work done while visiting AT&T Labs.