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
Efficient distributed restoration path selection for shared mesh restoration
IEEE/ACM Transactions on Networking (TON)
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
Network architecture for joint failure recovery and traffic engineering
Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
QoS protection optimisation for MPLS
International Journal of Communication Networks and Distributed Systems
Network architecture for joint failure recovery and traffic engineering
ACM SIGMETRICS Performance Evaluation Review - Performance evaluation review
Rerouting in advance reservation networks
Computer Communications
Joint coverage and link utilization for fast IP local protection
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 [1]) backbone 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 path (LSP) tunnels in advance and re-directing traffic as close to failure point as possible. To provide a guarantee of bandwidth protection, extra bandwidth has to be reserved on backup paths. Using path merging technique as described in IETF RFC 4090 only, the network is able to share some bandwidth on common links among backup paths of the same service LSP, i.e., so-called intra-sharing. But no solution is provided on how to share bandwidth among backup paths of different service LSPs, i.e., so-called inter-sharing. In this paper, we provide an efficient distributed bandwidth management solution. This solution allows bandwidth sharing among backup paths of the same and different service LSPs, i.e., both intra-sharing and inter-sharing, with a guarantee of bandwidth protection for any single node/link failure. We also propose an efficient algorithm for backup path selection with the associated signaling extensions for additional information distribution and collection. To evaluate our schemes, we compare them via simulation with the basic MPLS fast reroute proposal, IETF RFC 4090, on two networks. Our simulation results show that using our bandwidth management scheme can significantly reduce restoration overbuild from about 250% to about 100%, and our optimized backup path selection can further reduce restoration overbuild to about 60%.