Fast restoration of real-time communication service from component failures in multi-hop networks
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Restoration strategies and spare capacity requirements in self-healing ATM networks
IEEE/ACM Transactions on Networking (TON)
Stability issues in OSPF routing
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Reconfiguration of spare capacity for MPLS-based recovery in the internet backbone networks
IEEE/ACM Transactions on Networking (TON)
Detailed Study of IP/ Reconfigurable Optical Networks
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
Segment shared protection in mesh communications networks with bandwidth guaranteed tunnels
IEEE/ACM Transactions on Networking (TON)
Challenges for MPLS in optical network restoration
IEEE Communications Magazine
A novel path protection scheme for MPLS networks using multi-path routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
As service providers move more applications to their IP/MPLS (Multiple Protocol Label Switching) networks, rapid restoration upon failure becomes more and more crucial. Recently MPLS fast reroute has attracted lots of attention as it was designed to meet the needs of real-time applications, such as voice over IP. MPLS fast reroute achieves rapid restoration by computing and signaling backup label switched paths (LSP) in advance and re-directing traffic as close to failure point as possible. To provide a guarantee of failure restoration, extra bandwidth has to be reserved on backup LSPs. To improve the bandwidth utilization, path-merging technique was proposed to allow bandwidth sharing on common links among a service LSP and its backup LSPs. However, the sharing is very limited. In this paper, we provide efficient distributed solution, which would allow much broader bandwidth sharing among any backup LSPs from different service LSPs. We also propose an efficient algorithm for backup path selection to further increase the bandwidth sharing. The associated signaling extension for additional information distribution and collection is provided. To evaluate our solution, we compare its performance with the MPLS fast reroute proposal in IETF via simulation. The key figure-of-merit for restoration capacity efficiency is restoration overbuild, i.e., the ratio of restoration capacity to service capacity. Our simulation results show that our distributed solution reduces restoration overbuild from 2.5 to 1, and our optimized backup path selection further reduces restoration overbuild to about 0.5.