Maximizing Restorable Throughput in MPLS Networks

MPLS recovery mechanisms are increasing in popularity because they can guarantee fast restoration and high QoS assurance. Their main advantage is that their backup paths are established in advance, before a failure event takes place. Most research on the establishment of primary and backup paths has focused on minimizing the added capacity required by the backup paths in the network. However, this so-called Spare Capacity Allocation (SCA) metric is less practical for network operators who have a fixed capacitated network and want to maximize their revenues. In this paper, we present a comprehensive study on restorable throughput maximization in MPLS networks. We present the first polynomial-time algorithms for the splittable version of the problem. For the unsplittable version, we provide a lower bound for the approximation ratio and propose an approximation algorithm with an almost identical bound. We present an efficient heuristic which is shown to have excellent performance. One of our most important conclusions is that when one seeks to maximize revenue, local recovery should be the recovery scheme of choice.

[1]  Ratul Mahajan,et al.  Inferring link weights using end-to-end measurements , 2002, IMW '02.

[2]  Robert D. Doverspike,et al.  Comparison of capacity efficiency of DCS network restoration routing techniques , 1994, Journal of Network and Systems Management.

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

[4]  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).

[5]  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.

[6]  Ramaswamy Chandrasekaran,et al.  A comparative study of restoration schemes and spare capacity assignments in mesh networks , 2003, Proceedings. 12th International Conference on Computer Communications and Networks (IEEE Cat. No.03EX712).

[7]  Ezhan Karasan,et al.  Robust path design algorithms for traffic engineering with restoration in MPLS networks , 2002, Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications.

[8]  B. Mukherjee,et al.  New and improved approaches for shared-path protection in WDM mesh networks , 2004, Journal of Lightwave Technology.

[9]  Eric C. Rosen,et al.  Multiprotocol Label Switching Architecture , 2001, RFC.

[10]  Chen-Nee Chuah,et al.  Analysis of link failures in an IP backbone , 2002, IMW '02.

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

[12]  Thomas Frisanco,et al.  Optimal spare capacity design for various protection switching methods in ATM networks , 1997, Proceedings of ICC'97 - International Conference on Communications.

[13]  Subhash Suri,et al.  Routing bandwidth guaranteed paths with restoration in label switched networks , 2001, Proceedings Ninth International Conference on Network Protocols. ICNP 2001.

[14]  Biswanath Mukherjee,et al.  Survivable WDM mesh networks , 2003 .

[15]  Ratul Mahajan,et al.  Measuring ISP topologies with Rocketfuel , 2004, IEEE/ACM Transactions on Networking.

[16]  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.

[17]  A. Barabasi,et al.  Scale-free characteristics of random networks: the topology of the world-wide web , 2000 .

[18]  Salil P. Vadhan,et al.  Computational Complexity , 2005, Encyclopedia of Cryptography and Security.

[19]  Chunming Qiao,et al.  Distributed Partial Information Management (DPIM) schemes for survivable networks - Part I , 2002 .

[20]  Filip De Turck,et al.  Dimensioning of survivable WDM networks , 1998, IEEE J. Sel. Areas Commun..

[21]  Randeep Bhatia,et al.  Simple Pre-Provisioning Scheme to Enable Fast Restoration , 2007, IEEE/ACM Transactions on Networking.

[22]  Joseph Naor,et al.  Building Edge-Failure Resilient Networks , 2002, IPCO.

[23]  Jacek Kowalski,et al.  Modelling Traffic Demand Between Nodes in a Telecommunications Network , 1995 .

[24]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[25]  Yu Liu,et al.  Spare Capacity Planning for Survivable Mesh Networks , 2000, NETWORKING.

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

[27]  Chunming Qiao,et al.  Achieving fast and bandwidth-efficient shared-path protection , 2003 .

[28]  Lorne Mason,et al.  Comparison of two path restoration schemes in self-healing networks , 2002, Comput. Networks.

[29]  Piet Demeester,et al.  Spare capacity assignment for different restoration strategies in mesh survivable networks , 1997, Proceedings of ICC'97 - International Conference on Communications.

[30]  A. Srinivasan.  Approximation algorithms via randomized rounding : a survey , 1999 .

[31]  Ue-Pyng Wen,et al.  Applying tabu search to spare capacity planning for network restoration , 1999, Comput. Oper. Res..

[32]  Cengiz Alaettinoglu,et al.  Towards Milli-Second IGP Convergence , 2000 .

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

[34]  Ronald V. Book,et al.  Review: Michael R. Garey and David S. Johnson, Computers and intractability: A guide to the theory of $NP$-completeness , 1980 .

[35]  Satish K. Tripathi,et al.  QoS aware path protection schemes for MPLS networks , 2002 .

[36]  Ibrahim Matta,et al.  BRITE: an approach to universal topology generation , 2001, MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.

[37]  M. Herzberg,et al.  The hop-limit approach for spare-capacity assignment in survivable networks , 1995, TNET.

[38]  Gianpaolo Oriolo,et al.  Reserving Resilient Capacity in a Network , 2001, SIAM J. Discret. Math..

[39]  Biswanath Mukherjee,et al.  Survivable WDM mesh networks. Part I-Protection , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[40]  Murali S. Kodialam,et al.  Capacity allocation and routing of locally restorable bandwidth guaranteed connections , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[41]  Gabi Nakibly,et al.  Maximizing Restorable Throughput in MPLS Networks , 2008, INFOCOM 2008.

[42]  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).

[43]  Joseph Naor,et al.  Building Edge-Failure Resilient Networks , 2002, Algorithmica.

[44]  Venkatesan Guruswami,et al.  Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems , 1999, STOC '99.

[45]  Noélia S. C. Correia,et al.  Protection Schemes for IP-over-WDM Networks: Throughput and Recovery Time Comparison , 2006, Photonic Network Communications.

[46]  Imrich Chlamtac,et al.  Lightpath communications: an approach to high bandwidth optical WAN's , 1992, IEEE Trans. Commun..

[47]  Ariel Orda,et al.  Algorithms for computing QoS paths with restoration , 2005, IEEE/ACM Transactions on Networking.

[48]  Katherine Guo,et al.  Routing Bandwidth Guaranteed Paths with Local Restoration in Label Switched Networks , 2022 .

[49]  Yossi Azar,et al.  Strongly Polynomial Algorithms for the Unsplittable Flow Problem , 2001, IPCO.

[50]  Athina Markopoulou,et al.  Characterization of failures in an IP backbone , 2004, IEEE INFOCOM 2004.

[51]  Wayne D. Grover,et al.  Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks , 1998, TNET.