IP layer restoration and network planning based on virtual protection cycles

We describe a novel restoration strategy called virtual protection cycles (p-cycles, patents pending) for extremely fast restoration in IP networks. Originally conceived for use in WDM and Sonet transport networks, we outline the adaption of the p-cycle concept to an IP environment. In an IP router-based network, p-cycles are implemented with virtual circuits techniques (such as an MPLS label switched path, or other means) to form closed logical loops that protect a number of IP links, or a node. In the event of failure, packets which would normally have been lost are encapsulated with a p-cycle IP address and reenter the routing table, which diverts them onto a protection cycle. They travel by normal forwarding or label switching along the p-cycle until they reach a node where the continuing route cost to the original destination is lower than that at the p-cycle entry node. Diverted packets are deencapsulated (dropped from the p-cycle) at that node and follow a normal (existing) route from there to their destination. Conventional routing protocols such as OSPF remain in place and operate as they do today, to develop a longer term global update to routing tables. Diversionary flows on the p-cycle inherently cease when the global routing update takes effect in response to the failed link or node. The p-cycle thus provides an immediate real-time detour, preventing packet loss, until conventional global routing reconvergence occurs. The aim of the paper is to explain the basic p-cycle concept and its adaptation to both link and node restoration in the IP transport layer, and to outline certain initial results on the problem of optimized design of p-cycle based IP networks.

[1]  T. V. Lakshman,et al.  A service restoration time study for distributed control SONET digital cross-connect system self-healing networks , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[2]  J. Moy,et al.  OSPF: Anatomy of an Internet Routing Protocol , 1998 .

[3]  Demetrios Stamatelakis,et al.  Theory and Algorithms for Preconfiguration of Spare Capacity in Mesh Restorable Networks , 1997 .

[4]  John Moy,et al.  OSPF Version 2 , 1998, RFC.

[5]  Joseph Sosnosky,et al.  Service applications for SONET DCS distributed restoration , 1994, IEEE J. Sel. Areas Commun..

[6]  Keiji Miyazaki,et al.  Distributed self‐healing network and its optimum spare‐capacity assignment algorithm , 1991 .

[7]  Salah Aidarous,et al.  Telecommunications Network Management into the 21st Century , 1995 .

[8]  Christian Huitema,et al.  An Architecture for Residential Internet Telephony Service , 1999, IEEE Internet Comput..

[9]  W. D. Grover,et al.  Optimized design of ring-based survivable networks , 1995, Canadian Journal of Electrical and Computer Engineering.

[10]  Wayne D. Grover,et al.  Dependence of network capacity requirements on the allowable flow convergence overloads in ATM backup VP restoration , 1997 .

[11]  M. Herzberg,et al.  An optimal spare-capacity assignment model for survivable networks with hop limits , 1994, 1994 IEEE GLOBECOM. Communications: The Global Bridge.

[12]  David Powell,et al.  Group communication , 1996, CACM.

[13]  Wayne D. Grover,et al.  SELF-ORGANIZING CLOSED PATH CONFIGURATION OF RESTORATION CAPACITY IN BROADBAND MESH TRANSPORT NETWORKS , 1998 .

[14]  Wayne D. Grover Bridging the Ring-Mesh Dichotomy With P-Cycles , 2000 .

[15]  Wayne D. Grover,et al.  Theoretical underpinnings for the efficiency of restorable networks using preconfigured cycles ("p-cycles") , 2000, IEEE Trans. Commun..

[16]  Fred Baker,et al.  RIP Version 2 MIB Extensions , 1993, Request for Comments.

[17]  Fred Baker,et al.  RIP Version 2 MIB Extension , 1994, Request for Comments.

[18]  W. D. Grover,et al.  VP-BASED ATM NETWORK DESIGN WITH CONTROLLED OVER-SUBSCRIPTION OF RESTORATION CAPACITY , 1998 .

[19]  Gary Scott Malkin,et al.  RIP Version 2 Carrying Additional Information , 1993, RFC.

[20]  Christian Huitema,et al.  Routing in the Internet , 1995 .

[21]  Wayne D. Grover,et al.  Optimal capacity placement for path restoration in mesh survivable networks , 1996, Proceedings of ICC/SUPERCOMM '96 - International Conference on Communications.

[22]  Charles L. Hedrick,et al.  Routing Information Protocol , 1988, RFC.

[23]  Wayne D. Grover,et al.  Cycle-oriented distributed preconfiguration: ring-like speed with mesh-like capacity for self-planning network restoration , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).