An efficient column generation design method of p-cycle-based protected working capacity envelope

The protected working capacity envelope (PWCE) concept was proposed by Grover (2004) in order to simplify network operations and management in survivable wavelength division multiplexing (WDM) networks. In this paper, we focus on the design of PCWE and investigate a new design method based on column generation (CG) for designing survivable WDM networks based on p-cycle PWCE. Proposed design algorithms for PWCE and p-cycle proceed in two steps: A first step where a large (sometimes huge) number of cycles is enumerated followed by a second step where the selection of the most promising p-cycles is made with the help of combinatorial optimization tools. In this paper, we develop a new (single-step) method based on large scale optimization tools, that is, CG techniques, where the generation of cycles is dynamic and embedded within the optimization process. The key advantage of CG techniques is that no a priori cycle enumeration step is required ahead of the optimization process: The generation of the relevant cycles, only one or few at a time, is embedded in the optimization process. We conducted intensive computational experiments to compare the performances of our CG algorithms with four other algorithms in the literature. The different algorithms were compared with regard to several design metrics and running time. Results obtained in the experiments on five different network instances show that the CG-based algorithm outperforms by far all proposed algorithms in the literature, both with respect to the scalability (much smaller computing times for large network instances) and also with respect to the quality of the solutions.

[1]  Celso C. Ribeiro,et al.  Routing and wavelength assignment by partition colouring , 2006, Eur. J. Oper. Res..

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

[3]  Wayne D. Grover,et al.  Design and performance of protected working capacity envelopes based on p-cycles for dynamic provisioning of survivable services , 2005 .

[4]  Zhenrong Zhang,et al.  Dynamically survivable WDM network design with p-cycle-based PWCE , 2005, IEEE Communications Letters.

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

[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]  Fangcheng Tang,et al.  Dynamic establishment of restorable connections using p-cycle protection in WDM networks , 2005, 2nd International Conference on Broadband Networks, 2005..

[8]  Wayne D. Grover,et al.  Performance of protected working capacity envelopes based on p-Cycles: fast, simple, and scalable dynamic service provisioning of survivable services , 2005, SPIE/OSA/IEEE Asia Communications and Photonics.

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

[10]  Wayne D. Grover,et al.  Optimized Design of Ring-Mesh Hybrid Networks , 2000 .

[11]  Kazutaka Murakami,et al.  Comparative study on restoration schemes of survivable ATM networks , 1997, Proceedings of INFOCOM '97.

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

[13]  Wayne D. Grover,et al.  Algorithmic approaches for efficient enumeration of candidate p-cycles and capacitated p-cycle network design , 2003, Fourth International Workshop on Design of Reliable Communication Networks, 2003. (DRCN 2003). Proceedings..

[14]  Oliver W. W. Yang,et al.  Finding protection cycles in DWDM networks , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

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

[16]  Dominic A. Schupke,et al.  Off-line lightpath routing in WDM networks with different wavelength converter configurations , 2002, Workshop on High Performance Switching and Routing, Merging Optical and IP Technologie.

[17]  Wayne D. Grover,et al.  Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking , 2003 .

[18]  Yuval Rabani,et al.  Linear Programming , 2007, Handbook of Approximation Algorithms and Metaheuristics.

[19]  Brigitte Jaumard,et al.  Comparison of ILP formulations for the RWA problem , 2004, Opt. Switch. Netw..

[20]  Sudipta Sengupta,et al.  Capacity efficient distributed routing of mesh-restored lightpaths in optical networks , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).