Survivable Routing of Mesh Topologies in IP-over-WDM Networks by Recursive Graph Contraction

Authors:
M. Kurant;P. Thiran
Affiliations:
Sch. of Commun. & Comput. Sci., EPFL, Lausanne;-
Venue:
IEEE Journal on Selected Areas in Communications
Year:
2007

Citing 0
Cited 11

Distributed media rate allocation in multipath networks

Image Communication
Logical topology augmentation for guaranteed survivability under multiple failures in IP-over-WDM optical network

ANTS'09 Proceedings of the 3rd international conference on Advanced networks and telecommunication systems
Primal meets dual: a generalized theory of logical topology survivability in IP-over-WDM optical networks

COMSNETS'10 Proceedings of the 2nd international conference on COMmunication systems and NETworks
Cross-layer survivability in WDM-based networks

IEEE/ACM Transactions on Networking (TON)
Survivable virtual network embedding

NETWORKING'10 Proceedings of the 9th IFIP TC 6 international conference on Networking
Survivable IP topology design with re-use of backup wavelength capacity in optical backbone networks

Optical Switching and Networking
Logical topology augmentation for guaranteed survivability under multiple failures in IP-over-WDM optical networks

Optical Switching and Networking
Selective survivability with disjoint nodes and disjoint lightpaths for layer 1 VPN

Optical Switching and Networking
Surviving failures in bandwidth-constrained datacenters

Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication
Achieving effective resilience for QoS-aware application mapping

Computer Networks: The International Journal of Computer and Telecommunications Networking
Surviving failures in bandwidth-constrained datacenters

ACM SIGCOMM Computer Communication Review - Special october issue SIGCOMM '12

Quantified Score

Hi-index	0.07

Visualization

Abstract

Failure restoration at the IP layer in IP-over-WDM networks requires to map the IP topology on the WDM topology in such a way that a failure at the WDM layer leaves the IP topology connected. Such a mapping is called survivable. Finding a survivable mapping is known to be NP-complete, making it impossible in practice to assess the existence or absence of such a mapping for large networks, (i) we first introduce a new concept of piecewise survivability, which makes the problem much easier in practice (although still NP-complete), and allows us to formally prove that a given survivable mapping does or does not exist, (ii) secondly, we show how to trace the vulnerable areas in the topology, and how to strengthen them to enable a survivable mapping, (iii) thirdly, we give an efficient and scalable algorithm that finds a survivable mapping. In contrast to the heuristics proposed in the literature to date, our algorithm exhibits a number of provable properties (e.g., it guarantees the piecewise survivability) that are crucial for (i) and (ii)