Design and performance of protected working capacity envelopes based on p-cycles for dynamic provisioning of survivable services

As an alternative to the shared backup path protection (SBPP) method, we develop a framework for dynamic provisioning of survivable services through the use of p-cycles to form a protected working capacity envelope (PWCE) within which dynamic provisioning of protected services is greatly simplified. With a PWCE, arbitrarily fast dynamic service demands can be handled with much less complexity (in terms of database maintenance and state update dissemination) than with SBPP. Only a simple open-shortest-path-first (OSPF) topology view of nonexhausted spans in the envelope is required. If a new path can be routed through the envelope, it is protected by virtue of being routable. This is in contrast to needing a full database of the network state so that the end user can set up a shared backup protection path under SBPP. In addition, dissemination of spare capacity sharing updates occurs only on the time scale of the nonstationary evolution of the demand statistics, not like SBPP, which occurs on the time scale of individual connection arrivals or departures. During statistically stationary periods there is no dissemination of spare capacity sharing updates whatsoever with an envelope that is well matched to its load. The PWCE concept thus offers some new trade-offs between operational simplicity and spare capacity efficiency. Under the PWCE concept p-cycles are of particular interest for consideration because, although many protection techniques can be the basis of PWCE operation p-cycles offer the unique combination of ring-like protection times with the capacity efficiency of shared-mesh networks. But, in addition, p-cycles offer a further important property for a transparent optical network: that of providing fully pre-cross-connected protection paths. Because all protection paths are preconnected structures, optical transmission path integrity can be validated before failure and is not of such concern as it is in schemes where optical replacement path segments of several wavelength channels would have to be assembled on the fly (without the benefit of o-e-o between stages). The main contribution of this work is the detailed implementation and simulation of test networks operating under PWCE and designed with novel envelope volume maximizing formulations. A wide range of network capacity environments were considered to find that p-cycle-based PWCE is close to SBPP in blocking performance while simultaneously offering much simpler operation and a faster restoration speed.

[1]  Eric Bouillet,et al.  Stochastic approaches to compute shared mesh restored lightpaths in optical network architectures , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[2]  Wayne D. Grover,et al.  Influence of modularity and economy-of-scale effects on design of mesh-restorable DWDM networks , 2000, IEEE Journal on Selected Areas in Communications.

[3]  Wayne D. Grover,et al.  Design of Protected Working Capacity Envelopes Based on p -Cycles: An Alternative Framework for Survivable Automated Lightpath Provisioning , 2005 .

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

[5]  Wayne D. Grover,et al.  The Forcer Concept and Express Route Planning in Mesh-Survivable Networks , 2004, Journal of Network and Systems Management.

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

[7]  Biswanath Mukherjee,et al.  Near-optimal approaches for shared-path protection in WDM mesh networks , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[8]  Raouf Boutaba,et al.  Guest Editorial Autonomic Communication Systems , 2005 .

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

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

[11]  Chao Lu,et al.  Efficient heuristic algorithms for light-path routing and wavelength assignment in WDM networks under dynamically varying loads , 2001, Comput. Commun..

[12]  Gangxiang Shen,et al.  Automatic lightpath service provisioning with an adaptive protected working capacity envelope based on p-cycles , 2005, DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005..

[13]  Wayne D. Grover,et al.  The protected working capacity envelope concept: an alternate paradigm for automated service provisioning , 2004, IEEE Communications Magazine.

[14]  Pin-Han Ho.  State-of-the-art progress in developing survivable routing schemes in mesh WDM networks , 2004, IEEE Communications Surveys & Tutorials.

[15]  Wayne D. Grover,et al.  Span-Restorable Mesh Networks with Multiple Quality of Protection (QoP) Service Classes , 2005, Photonic Network Communications.

[16]  Wayne D. Grover,et al.  Exploiting forcer structure to serve uncertain demands and minimize redundancy of p-cycle networks , 2003, OptiComm: Optical Networking and Communications Conference.

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

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

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