Near optimal routing and capacity management for PWCE-based survivable WDM networks

Protected Working Capacity Envelope (PWCE) has been proposed to simplify resource management and traffic control for survivable WDM networks. In a PWCE-based network, part of the link capacity is reserved for accommodating working routes, and the remaining capacity is reserved for backup routes. The shortest path routing is applied in PWCE-based networks. An arrival call is accepted only when each link along the shortest path has a free working channel. Such a working path routing scheme greatly simplifies the call admission control process for dynamic traffic, and it is especially suitable for implementation in a distributed manner among network nodes. In this article, we investigate two protection strategies: Bundle Protection (BP) and Individual Protection (IDP). In BP, only one backup path can be used to protect a failure component, whereas multiple backup paths can be used in IDP. We formulate four mixed integer non-linear programming (MINLP) problems using BP and IDP strategies for single link and single node failure protection. Each model is designed to determine link metrics for shortest working path routing, working and backup channel assignments, and backup path planning. Our objective is to minimize call-blocking probability on the bottleneck link. Since these models are highly non-linear and non-convex, it is difficult to obtain exact global optimal solutions. We propose a Simulated Annealing-based Heuristic (SAH) algorithm to obtain near optimal solutions. This SAH adopts the concepts of simulated annealing as well as the bi-section technique to minimize call-blocking probabilities. To evaluate the performance, we made simulation comparisons between SAH and the unity link weight assignment scheme. The results indicate that SAH can greatly reduce call-blocking probabilities on benchmark and the randomly generated networks.

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

[2]  Biswanath Mukherjee,et al.  Subpath protection for scalability and fast recovery in optical WDM mesh networks , 2004, IEEE Journal on Selected Areas in Communications.

[3]  Tibor Cinkler,et al.  Segment shared protection in mesh communications networks with bandwidth guaranteed tunnels , 2004, IEEE/ACM Transactions on Networking.

[4]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

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

[6]  Lemin Li,et al.  Shared Sub-Path Protection Algorithm in Traffic-Grooming WDM Mesh Networks , 2004, Photonic Network Communications.

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

[8]  Eytan Modiano,et al.  Survivable lightpath routing: a new approach to the design of WDM-based networks , 2002, IEEE J. Sel. Areas Commun..

[9]  Murti V. Salapaka,et al.  A practical approach to operating survivable WDM networks , 2002, IEEE J. Sel. Areas Commun..

[10]  Arun K. Somani,et al.  A p-cycle based survivable design for dynamic traffic in WDM networks , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

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

[12]  Chunming Qiao,et al.  Novel algorithms for shared segment protection , 2003, IEEE J. Sel. Areas Commun..

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

[14]  Pin-Han Ho,et al.  OPN02-2: Inter-Group Shared Protection (I-GSP): A Scalable Solution for Survivable WDM Networks , 2006, IEEE Globecom 2006.

[15]  Brigitte Jaumard,et al.  Survivable WDM Networks Design with Non-Simple p-Cycle-Based PWCE , 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.

[16]  Xiaoping Zheng,et al.  Achieving Resource-Efficient Survivable Provisioning in Service Differentiated WDM Mesh Networks , 2008, Journal of Lightwave Technology.

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

[18]  Lei Guo,et al.  Path-based routing provisioning with mixed shared protection in WDM mesh networks , 2006, Journal of Lightwave Technology.

[19]  Brigitte Jaumard,et al.  Design of flexible protection plans in survivable WDM networks: An application to PWCE , 2009, 2009 IEEE Sarnoff Symposium.

[20]  Suresh Subramaniam,et al.  Survivability in optical networks , 2000, IEEE Netw..