Efficient distributed bandwidth management for MPLS fast reroute

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%.

[1]  Tony Li,et al.  Intermediate System to Intermediate System (IS-IS) Extensions for Traffic Engineering (TE) , 2004, RFC.

[2]  Dave Katz,et al.  Traffic Engineering (TE) Extensions to OSPF Version 2 , 2003, RFC.

[3]  Murali S. Kodialam,et al.  Dynamic routing of bandwidth guaranteed tunnels with restoration , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[4]  Tibor Cinkler,et al.  Segment shared protection in mesh communications networks with bandwidth guaranteed tunnels , 2004, IEEE/ACM Transactions on Networking.

[5]  Alia Atlas,et al.  Fast Reroute Extensions to RSVP-TE for LSP Tunnels , 2005, RFC.

[6]  Kang G. Shin,et al.  Fast restoration of real-time communication service from component failures in multi-hop networks , 1997, SIGCOMM '97.

[7]  Lorne Mason,et al.  Restoration strategies and spare capacity requirements in self-healing ATM networks , 1999, TNET.

[8]  Yu Liu,et al.  Approximating optimal spare capacity allocation by successive survivable routing , 2001, IEEE/ACM Transactions on Networking.

[9]  Jon G. Riecke,et al.  Stability issues in OSPF routing , 2001, SIGCOMM 2001.

[10]  Gianpaolo Oriolo,et al.  A multilayer solution for path provisioning in new-generation optical/MPLS networks , 2003 .

[11]  Vishal Sharma,et al.  Framework for Multi-Protocol Label Switching (MPLS)-based Recovery , 2003, RFC.

[12]  H. T. Mouftah,et al.  On achieving optimal survivable routing for shared protection in survivable next-generation Internet , 2004, IEEE Transactions on Reliability.

[13]  Robert D. Doverspike,et al.  Efficient distributed restoration path selection for shared mesh restoration , 2003, TNET.

[14]  Robert Doverspike,et al.  Challenges for MPLS in optical network restoration , 2001, IEEE Commun. Mag..

[15]  Murali S. Kodialam,et al.  Dynamic routing of locally restorable bandwidth guaranteed tunnels using aggregated link usage information , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[16]  Chunming Qiao,et al.  Distributed partial information management (DPIM) schemes for survivable networks .1 , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[17]  Robert D. Doverspike,et al.  Efficient distributed path selection for shared restoration connections , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[18]  Li Li,et al.  LSP Modification Using CR-LDP , 2002, RFC.