NPP: A Facility Based Computation Framework for Restoration Routing Using Aggregate Link Usage Information

We present NPP – a new framework for online routing of bandwidth guaranteed paths with local restoration. NPP relies on the propagation of only aggregate link usage information [2,9] through routing protocols. The key advantage of NPP is that it delivers the bandwidth sharing performance achieved by propagating complete per path link usage information [9], while incurring significantly reduced routing protocol overhead. We specify precise implementation models for the restoration routing frameworks presented in [1] and [2] and compare their traffic placement characteristics with those of NPP. Simulation results show that NPP performs significantly better in terms of number of LSPs accepted and total bandwidth placed on the network. For 1000 randomly selected LSP requests on a 20-node homogenous ISP network [8], NPP accepts 775 requests on average compared to 573 requests accepted by the framework of [2] and 693 requests accepted by the framework of [1]. Experiments with different sets of LSP requests and on other networks indicate that NPP results in similar performance gains.

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

[2]  G. Swallow MPLS advantages for traffic engineering , 1999, IEEE Commun. Mag..

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

[4]  Satish K. Tripathi,et al.  Quality of service based routing: a performance perspective , 1998, SIGCOMM '98.

[5]  Yakov Rekhter,et al.  Mpls: Technology and Applications , 2000 .

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

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

[8]  Piet Demeester,et al.  Network Recovery: Protection and Restoration of Optical, SONET-SDH, IP, and MPLS , 2004 .

[9]  Chen-Nee Chuah,et al.  Feasibility of IP restoration in a tier 1 backbone , 2004, IEEE Network.

[10]  Angela L. Chiu,et al.  Overview and Principles of Internet Traffic Engineering , 2002, RFC.

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

[12]  Ram Dantu,et al.  Constraint-Based LSP Setup using LDP , 2002, RFC.

[13]  Vasseur Jp MPLS Traffic Engineering Fast reroute: backup tunnel path computation for bandwidth protection , 2003 .

[14]  T. V. Lakshman,et al.  Shared backup Label Switched Path restoration , 2001 .

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