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
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
Reliable routings in networks with generalized link failure events
IEEE/ACM Transactions on Networking (TON)
Computers and Operations Research
SRG-disjoint design with dedicated and shared protection
INOC'11 Proceedings of the 5th international conference on Network optimization
MSDP with ACO: A maximal SRLG disjoint routing algorithm based on ant colony optimization
Journal of Network and Computer Applications
Risk assessment of end-to-end disconnection in IP networks due to network failures
IPOM'06 Proceedings of the 6th IEEE international conference on IP Operations and Management
Disaster survivability in optical communication networks
Computer Communications
Hi-index | 0.00 |
Failure resilience is one of the desired features of the Internet. Most of the traditional restoration architectures are based on single-failure assumption which is unrealistic. 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 these form of failures under a common heading of shared-risk resource groups (SRRG) failures. In our research, we propose 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.