Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks
IEEE/ACM Transactions on Networking (TON)
Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs
IEEE/ACM Transactions on Networking (TON)
Graph Theory With Applications
Graph Theory With Applications
Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking
Emerging technologies for fiber network survivability
IEEE Communications Magazine
Heuristic algorithms for designing self-repairing protection trees in mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A resilient transparent optical network design with a pre-configured extended-tree scheme
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Differentiated quality-of-protection in survivable WDM mesh networks using p-structures
Computer Communications
| Hi-index | 0.00 |
Recently, a single-link failure protection scheme using protection tree has been proposed in [6].This scheme is scalable in that the protection tree can be adjusted dynamically as the network topology changes. A drawback of this scheme is that it may not be able to find a backup path for certain network links even if the network is 2-connected. In this paper, we first present a new protection tree scheme that can recover from any single-link failure in a 2-connected network. We then give an Integer Linear Program (ILP) formulation to compute a protection tree and allocate spare capacity on the network links so that the total spare capacity required is minimized. Finally, we present a distributed algorithm for fast double-link failure restoration using a protection tree. Simulation results show that around 70% of the double-link failures can be restored by our scheme even though the spare capacity in the network is planned for single-link failures. In addition, our scheme can achieve almost 100% restorability for double-link failures when spare capacity in the network is sufficiently large.