Sciweavers

Share
BROADNETS
2004
IEEE

A Scalable Algorithm for Survivable Routing in IP-Over-WDM Networks

9 years 5 months ago
A Scalable Algorithm for Survivable Routing in IP-Over-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 hereby is to make the routing survivable. We call a routing survivable if the connectivity of the logical network is guaranteed in case of a failure in the physical network. In this paper we describe FastSurv, a local search algorithm which can provide survivable routing in the presence of physical link failures. The algorithm can easily be extended for the case of node failures and multiple simultaneous link failures. In a large series of test runs, we show that FastSurv is much more scalable with respect to the number of nodes in the network than current state-ofthe-art algorithms, both in terms of solution quality and run time.
Frederick Ducatelle, Luca Maria Gambardella
Added 20 Aug 2010
Updated 20 Aug 2010
Type Conference
Year 2004
Where BROADNETS
Authors Frederick Ducatelle, Luca Maria Gambardella
Comments (0)
books