Optical networks: a practical perspective
Optical networks: a practical perspective
Protection interoperability for WDM optical networks
IEEE/ACM Transactions on Networking (TON)
Survivable embedding of logical topologies in WDM ring networks
Information Sciences—Informatics and Computer Science: An International Journal - Special issue: Photonics, networking & computing
Design of a Survivable WDM Photonic Network
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Issues for routing in the optical layer
IEEE Communications Magazine
Design protection for WDM optical networks
IEEE Journal on Selected Areas in Communications
Fault management in IP-over-WDM networks: WDM protection versus IP restoration
IEEE Journal on Selected Areas in Communications
Survivable lightpath routing: a new approach to the design of WDM-based networks
IEEE Journal on Selected Areas in Communications
A new approach for designing fault-tolerant WDM networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
An Evolutionary Algorithm for Survivable Virtual Topology Mapping in Optical WDM Networks
EvoWorkshops '09 Proceedings of the EvoWorkshops 2009 on Applications of Evolutionary Computing: EvoCOMNET, EvoENVIRONMENT, EvoFIN, EvoGAMES, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, EvoNUM, EvoSTOC, EvoTRANSLOG
Performance analysis of nature inspired heuristics for survivable virtual topology mapping
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Hi-index | 0.00 |
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 ofnodes in the network than current state-of-the-art algorithms, both in terms of solution quality and run time.