Survivable Networks: Algorithms for Diverse Routing
Survivable Networks: Algorithms for Diverse Routing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Routing restorable bandwidth guaranteed connections using maximum 2-route flows
IEEE/ACM Transactions on Networking (TON)
Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking
Optical layer survivability-an implementation perspective
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
Comparison of k-shortest paths and maximum flow routing for network facility restoration
IEEE Journal on Selected Areas in Communications
MSDP with ACO: A maximal SRLG disjoint routing algorithm based on ant colony optimization
Journal of Network and Computer Applications
Challenge-Aware traffic protection in wireless mobile backhaul networks
IFIP'12 Proceedings of the 2012 international conference on Networking
Diverse routing in networks with star SRLGs
Proceedings of the 2012 ACM conference on CoNEXT student workshop
An overview of algorithms for network survivability
ISRN Communications and Networking
Hi-index | 0.00 |
Failure resilience is a desired feature of the Internet. Most traditional restoration architectures assume single failure assumption, which is not adequate in present day WDM optical networks. Multiple link failure models, in the form of shared risk link groups (SRLG's) and shared risk node groups (SRNG's) are becoming critical in survivable optical network design. We classify both of these form of failures under a common scenario of shared risk resource groups (SRRG) failures. We develop graph transformation techniques for tolerating multiple failures arising out of shared resource group (SRRG) failures. Diverse routing in such multi-failure scenario essentially necessitates finding out two paths between a source and a destination that are SRRG disjoint. The generalized diverse routing problem has been proved to be NP-Complete. The proposed transformation techniques however provides a polynomial time solution for certain restrictive failure sets. We study how restorability can be achieved for dependent or shared risk link failures and multiple node failures and prove the validity of our approach for different network scenarios. Our proposed technique is capable of improving the diverse route computation by around 20-30% as compared to approaches proposed in the literature.