Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Grover W.: Mesh-Based Survivable Networks: Options and Strategies for Optical, MPLS, SONET, and ATM Networking. Prentice Hall, Englewood Cliffs, NJ (2004)
Kodialam, M., Lakshman, T.: Dynamic routing of bandwidth guaranteed tunnels with restoration. In: INFOCOM, vol. 2, pp. 902–911 (2000)
Sengupta, S., Ramamurthy, R.: Capacity efficient distributed routing of mesh-restored lightpaths in optical networks. In: Proceedings of IEEE Global Telecommunications Conference (GlobeCom 2001), pp. 2129–2133. San Antonio, TX (2001)
Ou C., Zhang J., Zang H., Sahasrabuddhe L., Mukherjee B.: New and improved approaches for shared-path protection in WDM networks. IEEE/OSA, J. Lightw. Technol. 22, 1223–1232 (2004)
Grover, W.D., Stamatelakis, D.: Cycle-oriented distributed preconfiguration: ring-like speed with mesh-like capacity for self-planning network restoration. In: IEEE International Conference on Communications (ICC 1998), pp. 537–543 (1998)
Grover W.: The protected working capacity envelope concept: an alternative paradigm for automated service provisioning. IEEE Commun. Mag. 42(1), 62–69 (2004)
Shen, G., Grover, W.D.: Performance of protected working capacity envelopes based on p-Cycles: fast, simple, and scalable dynamic service provisioning of survivable services. In: Proceedings of APOC, vol. 5626, pp. 519–533 (2004)
Zhang Z., Zhong W., Bose S.B.: Dynamically survivable WDM network design with p-cycle-based PWCE. IEEE Commun. Lett. 9(8), 756–758 (2005)
Shen G., Grover W.D.: Design and performance of protected working capacity envelopes based on p-cycles for dynamic provisioning of survivable services. J. Opt. Netw. 4, 361–390 (2005)
Shen, G., Grover, W.D.: Exploiting forcer structure to serve uncertain demands and minimize redundancy of p-cycle networks. In: Proceedings of 4th international Conference on Optical Networking and Communications (OptiComm 2003), vol. 5285, pp. 59–70 (2003)
Ruan, L., Tang, F.: Dynamic establishment of restorable connections using p-cycle protection in WDM networks. In: 2nd International Conference on Broadband Networks, vol. 1, pp. 137–144 (2005)
Schupke, D.: Off-line lightpath routing in WDM networks with different wavelength converter configurations. In: Workshop on High Performance Switching and Routing (HPSR). Workshop on Merging Optical and IP Technologies, pp. 283–288. IEICE/IEEE (2002)
Doucette, J., He, D., Grover, W.D., Yang, O.: Algorithmic approaches for efficient enumeration of candidate p-cycles and capacitated p-cycle network design. In: Proceedings of Fourth International Workshop on Design of Reliable Communication Networks (DRCN), pp. 212–220 (2003)
Zhang, H., Yang, O.: Finding protection cycles in dwdm networks. In: Proceedings of IEEE International Conference on Communications (ICC 2002), vol. 5, pp. 2756–2760 (2002)
Grover, W., Stamatelakis, D.: Bridging the ring-mesh dichotomy with p-cycles. In: Proceedings of IEEE/VDE Workshop on Design of Reliable Communication Networks (DRCN), pp. 92–104. Munich, Germany (1998)
Cplex: Using the Cplex TM Callable Library (Version 8.1). Cplex Optimization Inc. (2003)
Chvatal V.: Linear Programming. Freeman, New York (1983)
Jaumard B., Meyer C., Thiongane B.: Comparison of ILP formulations for the RWA problem. Opt. Switch. Netw. 4(3–4), 157–172 (2007)
Murakami, K., Kim, H.S.: Comparative study on restoration schemes of survivable ATM networks. In: INFOCOM, pp. 345–352 (1997)
Noronha T., Ribeiro C.: Routing and wavelength assignment by partition coloring. Eur. J. Oper. Res. 171(3), 797–810 (2006)
Grover, W., Martens, R.: Optimized design of ring-mesh hybrid networks. In: Proceedings of IEEE/VDE Workshop on Design of Reliable Communication Networks (DRCN), pp. 291–297. Munich, Germany (2000)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Sebbah, S., Jaumard, B. An efficient column generation design method of p-cycle-based protected working capacity envelope. Photon Netw Commun 24, 167–176 (2012). https://doi.org/10.1007/s11107-012-0377-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11107-012-0377-8