Integer and combinatorial optimization
Integer and combinatorial optimization
Faster algorithms for the shortest path problem
Journal of the ACM (JACM)
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Some principles for designing a wide-area WDM optical network
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Optical networks: a practical perspective
Optical networks: a practical perspective
Survivable Routing in WDM Networks
ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
On Failure Dependent Protection in Optical Grooming Networks
DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
A Scalable Algorithm for Survivable Routing in IP-Over-WDM Networks
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
Survivable Virtual Topology Routing under Shared Risk Link Groups in WDM Networks
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
Survivability and Traffic Grooming in WDM Optical Networks
Survivability and Traffic Grooming in WDM Optical Networks
Dissemination of Information in Optical Networks: From Technology to Algorithms (Texts in Theoretical Computer Science. An EATCS Series)
Optical layer survivability: a services perspective
IEEE Communications Magazine
Design of logical topologies for wavelength-routed 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
IEEE Journal on Selected Areas in Communications
Design and provisioning of WDM networks with multicast traffic grooming
IEEE Journal on Selected Areas in Communications - Part Supplement
Traffic grooming in WDM networks: past and future
IEEE Network: The Magazine of Global Internetworking
Multi-objective routing wavelength assignment in WDM network using SPEA2 approach
ISCIT'09 Proceedings of the 9th international conference on Communications and information technologies
| Hi-index | 0.00 |
In recent years, path protection has emerged as a widely accepted technique for designing survivable WDM networks. This approach is attractive, since it is able to provide bandwidth guarantees in the presence of link failures. However, it requires allocating resources for backup lightpaths, which remain idle under normal fault-free conditions. In this paper, we introduce a new approach for designing fault-tolerant WDM networks, based on the concept of survivable routing. Survivable routing of a logical topology ensures that the lightpaths are routed in such a way that a single link failure does not disconnect the network. When a topology is generated using our approach, it is guaranteed to have a survivable routing. We further ensure that the logical topology is able to handle the entire traffic demand after any single link failure. We first present an ILP that optimally designs a survivable logical topology, and then propose a heuristic for larger networks. Experimental results demonstrate that this new approach is able to provide guaranteed bandwidth, and is much more efficient in terms of resource utilization, compared to both dedicated and shared path protection.