FastSurv: a new efficient local search algorithm for survivable routing in WDM networks

In IP-over-WDM networks, a logical IP network has to be routed on top of a physical optical fiber network. An important challenge is to make this routing survivable. We call a routing survivable if no single physical link failure can disconnect the logical topology. In this paper we present FastSurv, a local search algorithm for survivable routing. FastSurv works in an iterated way: after each iteration it learns more about the structure of the logical graph and in the next iteration it uses this information to improve its solution. We also extend the algorithm to take link capacity constraints into account. We show that our simple algorithm can produce better and faster results than current state-of-the-art algorithms.