RWA and p-Cycles

While there has been many studies on the efficient design of p-cycles focusing on optimizing their spare capacity efficiency, few of them consider such a design under the wavelength continuity assumption, i.e., no wavelength converter at any node. Consequently, few authors look at the routing and wavelength assignment in the context of p-cycles, where p-cycles have to be assigned the same wavelength as the paths of which they protect at least one link. In this paper, we propose to investigate thoroughly the issue of wavelength conversion vs. wavelength continuity for p-cycles, with large scale optimization tools (decomposition techniques) in order to get an exact estimate of the consequences of the wavelength continuity assumption on the spare capacity requirements and on the provisioning cost. The recourse to decomposition techniques allows the design of exact efficient scalable models contrarily to heuristics which ensure scalability but no accuracy guarantee. In particular, it allows an on-line generation of improving p-cycles, one after the other with respect to the objective, instead of a costly computing time off-line generation of p-cycles as in previous studies, a key issue for a scalable solution. Numerical results show that the difference between the capacity requirement under wavelength conversion vs. under wavelength continuity is meaningless. Consequently, in view of the reduced provisioning cost (saving at least on the converters), we advocate the design of p-cycles under a wavelength continuity assumption.

[1]  Oliver W. W. Yang,et al.  Hierarchical Protection Tree Scheme for Failure Recovery in Mesh Networks , 2004, Photonic Network Communications.

[2]  C. Mauz Unified ILP formulation of protection in mesh networks , 2003, Proceedings of the 7th International Conference on Telecommunications, 2003. ConTEL 2003..

[3]  Matteo Fischetti,et al.  The symmetric generalized traveling salesman polytope , 1995, Networks.

[4]  Didier Colle,et al.  Influence of the IP Traffic Asymmetry on the Cost of the Optical Network Layer , 2004, Photonic Network Communications.

[5]  Daryoush Habibi,et al.  QRP02-5: Joint Optimization in Capacity Design of Networks with p-Cycle Using the Fundamental Cycle Set , 2006, IEEE Globecom 2006.

[6]  H.T. Mouftah,et al.  Survivability Approaches Using p-Cycles in WDM Mesh Networks Under Static Traffic , 2009, IEEE/ACM Transactions on Networking.

[7]  Leon S. Lasdon,et al.  Optimization Theory of Large Systems , 1970 .

[8]  Biswanath Mukherjee,et al.  Survivable WDM mesh networks , 2003 .

[9]  George B. Dantzig,et al.  Decomposition Principle for Linear Programs , 1960 .

[10]  Achim Autenrieth,et al.  Optimal configuration of p-cycles in WDM networks , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[11]  Wayne D. Grover,et al.  Comparison of p-cycles and p-trees in a unified mathematical framework , 2007, Photonic Network Communications.

[12]  Thomas K. Stidsen,et al.  Joint Routing and Protection Using p-cycles , 2005 .

[13]  Thomas K. Stidsen,et al.  Joint Optimization of Working and p-cycle Protection Capacity , 2004 .

[14]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[15]  Wayne D. Grover,et al.  Advances in optical network design with p-cycles: joint optimization and pre-selection of candidate p-cycles , 2002, IEEE/LEOS Summer Topi All-Optical Networking: Existing and Emerging Architecture and Applications/Dynamic Enablers of Next-Generation Optical Communications Systems/Fast Optical Processing in Optical.

[16]  Brigitte Jaumard,et al.  Design of survivable WDM networks using pre-configured protection structures with unrestricted shapes , 2010, Photonic Network Communications.

[17]  Tomas Olovsson,et al.  Trends and Differences in Connection-Behavior within Classes of Internet Backbone Traffic , 2008, PAM.

[18]  Michal Pióro,et al.  SNDlib 1.0—Survivable Network Design Library , 2010, Networks.

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

[20]  Brigitte Jaumard,et al.  How much wavelength conversion allows a reduction in the blocking rate , 2006 .

[21]  Jacques Desrosiers,et al.  Selected Topics in Column Generation , 2002, Oper. Res..