Hierarchical self-healing rings
IEEE/ACM Transactions on Networking (TON)
The hop-limit approach for spare-capacity assignment in survivable networks
IEEE/ACM Transactions on Networking (TON)
On the Complexity of Finding a Minimum Cycle Cover of a Graph
SIAM Journal on Computing
IEEE/ACM Transactions on Networking (TON)
Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks
IEEE/ACM Transactions on Networking (TON)
MPLS: technology and applications
MPLS: technology and applications
Generalized loop-back recovery in optical mesh networks
IEEE/ACM Transactions on Networking (TON)
Building Edge-Failure Resilient Networks
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Availability analysis of span-restorable mesh networks
IEEE Journal on Selected Areas in Communications
Fast reroute with pre-established bypass tunnel in MPLS
Computer Communications
Maximizing restorable throughput in MPLS networks
IEEE/ACM Transactions on Networking (TON)
Comparison of recovery schemes to maximize restorable throughput in multicast networks
Journal of Network and Computer Applications
| Hi-index | 0.00 |
Supporting fast restoration for general mesh topologies with minimal network over-build is a technically challenging problem. Traditionally, ring-based SONET networks have offered close to 50 ms restoration at the cost of requiring 100% over-build. Recently, fast (local) reroute has gained momentum in the context of MPLS networks. Fast reroute, when combined with pre-provisioning of protection capacities and bypass tunnels, enables faster restoration times in mesh networks. Pre-provisioning has the additional advantage of greatly simplifying network routing and signaling. Thus, even for protected connections, online routing can now be oblivious to the offered protection, and may only involve single shortest path computations. In this paper, we are interested in the problem of reserving the least amount of the network capacity for protection, while guaranteeing fast (local) reroute-based restoration for all the supported connections. We show that the problem is NP-complete, and we present efficient approximation algorithms for the problem. The solution output by our algorithms is guaranteed to use at most twice the protection capacity, compared to any optimal solution. These guarantees are provided even when the protection is for multiple link failures. In addition, the total amount of protection capacity reserved by these algorithms is just a small fraction of the amount reserved by existing ring-based schemes (e.g., SONET), especially on dense networks. The presented algorithms are computationally efficient, and can even be implemented on the network elements. Our simulation, on some standard core networks, show that our algorithms work well in practice as well.