Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
Journal of the ACM (JACM)
Loopback recovery from neighboring double-link failures in WDM mesh networks
Information Sciences—Informatics and Computer Science: An International Journal - Special issue: Photonics, networking & computing
Partial Path Protection for WDM Networks: End-to-End Recovery Using Local Failure Information
ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
1 + N network protection for mesh networks: network coding-based protection using p-cycles
IEEE/ACM Transactions on Networking (TON)
Robust network codes for unicast connections: a case study
IEEE/ACM Transactions on Networking (TON)
Fuzzy system parameters discovery by bacterial evolutionary algorithm
IEEE Transactions on Fuzzy Systems
IEEE Transactions on Information Theory
All optical XOR logic gates: technologies and experiment demonstrations
IEEE Communications Magazine
A 1+1 protection architecture for optical burst switched networks
IEEE Journal on Selected Areas in Communications
Survivability in optical networks
IEEE Network: The Magazine of Global Internetworking
IP restoration vs. WDM protection: is there an optimal choice?
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
Communication networks have to provide a high level of availability and instantaneous recovery after failures in order to ensure sufficient survivability for mission-critical services. Currently, dedicated path protection (or 1+1) is implemented in backbone networks to provide the necessary resilience and instantaneous recovery against single link failures with remarkable simplicity. However, in order to satisfy strict availability requirements, connections also have to be resilient against Shared Risk Link Group (SRLG) failures. In addition, switching matrix reconfigurations have to be avoided after a failure in order to guarantee instantaneous recovery. For this purpose, there are several possible realization strategies improving the characteristics of traditional 1+1 path protection by lowering reserved bandwidth while conserving all its favorable properties. These methods either utilize diversity coding, network coding, or generalize the disjoint-path constraint of 1+1. In this paper, we consider the cost aspect of the traditional and the alternative 1+1 realization strategies. We evaluate the bandwidth cost of different schemes both analytically and empirically in realistic network topologies. As the more complex realizations lead to NP-complete problems even in the single link failure case, we propose both Integer Linear Programming (ILP) based optimal methods, as well as heuristic and meta-heuristic approaches to solve them. Our findings provide a tool and guidelines for service providers for selecting the path protection method with the lowest bandwidth cost for their network corresponding to a given level of reliability.