Link utilization in survivable WDM mesh network

Protection and restoration are two techniques used in designing survivable Wavelength-division-multiplexing (WDM) networks. In this paper we propose new simple integer linear program (ILP) formulations for commonly accepted techniques such as, node-link and link-path model to allocate working and spare capacity in WDM mesh networks. Primary and backup lightpath allocation model is implemented by using two techniques such as, shortest path routing (SPR) algorithm and link utilization (LU) algorithm. LU algorithm is implemented with a dynamic link weight variable. In the same way spare capacity requirement is calculated for link restoration and path restoration model. Routing and wavelength assignment (RWA) is solved by wavelength continuity constraint. Multiple traffic patterns are generated using Poissons distribution. Simulation results validate that LU algorithm reduces link overhead marginally compared to SPR algorithm. Simulation is performed on widely used NSF network. We have identified the crucial links which are frequently used for traffic distribution.

[1]  Yufei Wang,et al.  Optical network design and restoration , 1999, Bell Labs Technical Journal.

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

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

[4]  Wayne D. Grover,et al.  IP layer restoration and network planning based on virtual protection cycles , 2000, IEEE Journal on Selected Areas in Communications.

[5]  C. Siva Ram Murthy,et al.  WDM Optical Networks: Concepts, Design, and Algorithms , 2001 .

[6]  Murti V. Salapaka,et al.  Approaches for capacity and revenue optimization in survivable WDM networks , 2001, J. High Speed Networks.

[7]  Murti V. Salapaka,et al.  Operating mesh-survivable WDM transport networks , 2000, SPIE Optics East.

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

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

[10]  Jeffery L. Kennington,et al.  Basic mathematical programming models for capacity allocation in mesh-based survivable networks ☆ , 2007 .

[11]  Deep Medhi,et al.  Network routing - algorithms, protocols, and architectures , 2007 .

[12]  Biswanath Mukherjee,et al.  A review of fault management in WDM mesh networks: basic concepts and research challenges , 2004, IEEE Netw..

[13]  P. Sreenivasa Kumar,et al.  Static lightpath establishment in WDM networks - New ILP formulations and heuristic algorithms , 2002, Comput. Commun..

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

[15]  H.T. Mouftah,et al.  P-cycles in multi-failure network survivability , 2005, Proceedings of 2005 7th International Conference Transparent Optical Networks, 2005..

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

[17]  Wayne D. Grover,et al.  Theoretical underpinnings for the efficiency of restorable networks using preconfigured cycles ("p-cycles") , 2000, IEEE Trans. Commun..