Lightpath Reconfiguration in WDM Networks

Lightpath reconfiguration is a networking task that can be performed in order to improve resource utilization. The lightpath reconfiguration problem becomes nontrivial when a new set of lightpaths requires the release of resources previously seized by the (working) lightpaths currently in place, but, in order to ensure continuity of the traffic flow, the working lightpaths cannot be torn down before the new ones are set up. Under this condition the reconfiguration can fall into a deadlock state, and deadlocks can only be solved by temporary disruption of some connections. At this point, traffic disruptions are necessary, and network operators must compensate customers with penalty fees for the service disruption. In this paper we focus on minimizing the number of simultaneously disrupted connections at any time during the reconfiguration process. In this paper, we propose a mixed-integer program (MIP) model, an exact algorithm, and a heuristic for solving the problem considering our objective.

[1]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[2]  Eric Mannie,et al.  Generalized Multi-Protocol Label Switching (GMPLS) Architecture , 2004, RFC.

[3]  Biswanath Mukherjee,et al.  Wavelength-routed optical networks: linear formulation, resource budgeting tradeoffs, and a reconfiguration study , 2000, TNET.

[4]  Adrian Farrel,et al.  A Lexicography for the Interpretation of Generalized Multiprotocol Label Switching (GMPLS) Terminology within the Context of the ITU-T's Automatically Switched Optical Network (ASON) Architecture , 2006, RFC.

[5]  Deep Medhi,et al.  Routing, flow, and capacity design in communication and computer networks , 2004 .

[6]  Biswanath Mukherjee,et al.  Virtual-topology adaptation for WDM mesh networks under dynamic traffic , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[7]  Arun K. Somani,et al.  Connection rerouting/network reconfiguration , 2003, Fourth International Workshop on Design of Reliable Communication Networks, 2003. (DRCN 2003). Proceedings..

[8]  Biswanath Mukherjee,et al.  Traffic grooming in an optical WDM mesh network , 2002, IEEE J. Sel. Areas Commun..

[9]  Jean-Sébastien Sereni,et al.  Rerouting requests in WDM networks , 2005 .

[10]  Jing-Yang Jou,et al.  Computing minimum feedback vertex sets by contraction operations and its applications on CAD , 1999, Proceedings 1999 IEEE International Conference on Computer Design: VLSI in Computers and Processors (Cat. No.99CB37040).

[11]  Eiji Oki,et al.  Path Computation Element Communication Protocol (PCEP) Requirements and Protocol Extensions in Support of Global Concurrent Optimization , 2009, RFC.

[12]  David Coudert,et al.  Network Reconfiguration using Cops-and-Robber Games , 2008 .

[13]  Fernando Solano,et al.  Analyzing two different objectives of the WDM lightpath reconfiguration problem , 2009, GLOBECOM 2009.

[14]  Dorian Mazauric,et al.  Reconfiguration of the routing in WDM networks with two classes of services , 2009, 2009 International Conference on Optical Network Design and Modeling.

[15]  Ramón Fabregat,et al.  G+: Enhanced Traffic Grooming in WDM Mesh Networks using Lighttours , 2007, IEEE Journal on Selected Areas in Communications.

[16]  Zhi-Quan Luo,et al.  Reconfiguration with no service disruption in multifiber WDM networks , 2005, Journal of Lightwave Technology.

[17]  B. Mukherjee,et al.  A Review of Routing and Wavelength Assignment Approaches for Wavelength- Routed Optical WDM Networks , 2000 .

[18]  David Coudert,et al.  Tradeoffs in process strategy games with application in the WDM reconfiguration problem , 2010, Theor. Comput. Sci..

[19]  Eytan Modiano,et al.  Traffic grooming in WDM networks , 2001, IEEE Commun. Mag..

[20]  Sudhir S. Dixit,et al.  Traffic grooming in mesh WDM optical networks - performance analysis , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[21]  Adrian Farrel,et al.  A Path Computation Element (PCE)-Based Architecture , 2006, RFC.