loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
First International Conference on Broadband Networks (BROADNETS'04)
A Scalable Algorithm for Survivable Routing in IP-Over-WDM Networks
San Jose, California, USA
October 25-October 29
ISBN: 0-7695-2221-1
Frederick Ducatelle, Istituto Dalle Molle di Studi sull'Intelligenza Artificiale (IDSIA), Switzerland
Luca M. Gambardella, Istituto Dalle Molle di Studi sull'Intelligenza Artificiale (IDSIA), Switzerland
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-of-the-art algorithms, both in terms of solution quality and run time.
Citation:
Frederick Ducatelle, Luca M. Gambardella, "A Scalable Algorithm for Survivable Routing in IP-Over-WDM Networks," broadnets, pp.54-63, First International Conference on Broadband Networks (BROADNETS'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.