Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
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
Survivable Routing in WDM Networks
ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
Survivable Mapping Algorithm by Ring Trimming (SMART) for Large IP-Over-WDM Networks
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
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
Survey on dependable IP over fiber networks
Dependable Systems
Selective survivability with disjoint nodes and disjoint lightpaths for layer 1 VPN
Optical Switching and Networking
| Hi-index | 0.00 |
In IP-over-WDM networks, a logical IP network is routed on top of a physical optical fiber network. An important challenge here is to make the routing survivable. We call a routing survivable if the connectivity of the logical network is guaranteed in the case of a failure in the physical network. In this paper we describe FastSurv, a local search algorithm for survivable routing. The algorithm works in an iterative manner: 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. The algorithm can take link capacity constraints into account and can be extended to deal with multiple simultaneous link failures and node failures. In a large series of tests we compare FastSurv with current state-of-the-art algorithms for this problem. We show that it can provide better solutions in much shorter time, and that it is more scalable with respect to the number of nodes, both in terms of solution quality and run time.