A Boolean satisfiability based solution to the routing and wavelength assignment problem in optical telecommunication networks

Wavelength division multiplexing (WDM) effectively multiplies the bandwidth of an optic fiber by transmitting data over several different wavelengths on the same fiber. WDM is widely used to handle the ever-increasing demand for bandwidth in fiber optic telecommunication networks. Routing and wavelength assignment (RWA) is a critical problem to be addressed in WDM optical telecommunication networks. The goal of RWA is to maximize throughput by optimally and simultaneously assigning routes and wavelengths for a given pattern of routing or connection requests. In this paper, we present a novel technique to solve the static RWA problem using Boolean satisfiability (SAT). After formulating the RWA problem as a SAT instance, we utilize a very efficient SAT solver to find a solution. We report results for networks with and without wavelength translation capabilities in the nodes. In both cases we obtain an assignment in significantly less than one second (which is 3-4 orders of magnitude faster than existing approaches) for a set of benchmark problems. Our technique can handle arbitrary network topologies, and, due to its efficiency, can be extended to handle dynamic RWA instances, in which the network topology, link capacities and connection requests are time-varying.

[1]  Emmanuel Dotaro,et al.  Routing and wavelength assignment of scheduled lightpath demands , 2003, IEEE J. Sel. Areas Commun..

[2]  Ken-ichi Sato.  Advances in Transport Network Technologies: Photonic Networks, ATM, and SDH , 1996 .

[3]  Jeffery L. Kennington,et al.  Wavelength Translation in WDM Networks: Optimization Models and Solution Procedures , 2004, INFORMS J. Comput..

[4]  Shi Zhang,et al.  Routing and wavelength assignment based on genetic algorithm , 2002, IEEE Commun. Lett..

[5]  Kumar N. Sivarajan,et al.  Algorithms for routing and wavelength assignment based on solutions of LP-relaxations , 2001, IEEE Communications Letters.

[6]  Filip De Turck,et al.  Dimensioning of survivable WDM networks , 1998, IEEE J. Sel. Areas Commun..

[7]  Sharad Malik,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[8]  D. Manjunath,et al.  Routing and wavelength assignment in optical networks from edge disjoint path algorithms , 2002, IEEE Communications Letters.

[9]  Yong-Sik Shin,et al.  Wavelength converter location and optical fiber dimensioning for limited channel convertible optical networks , 1998, IEEE GLOBECOM 1998 (Cat. NO. 98CH36250).

[10]  David S. Johnson,et al.  Computers and Inrracrobiliry: A Guide ro the Theory of NP-Completeness , 1979 .

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

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

[13]  B. Mukherjee,et al.  New and improved approaches for shared-path protection in WDM mesh networks , 2004, Journal of Lightwave Technology.

[14]  Joao Marques-Silva,et al.  GRASP-A new search algorithm for satisfiability , 1996, Proceedings of International Conference on Computer Aided Design.

[15]  L. Wuttisittikulkij,et al.  Design of an efficient and practical algorithm for wavelength assignment in multi-wavelength ring transport networks , 1997, GLOBECOM 97. IEEE Global Telecommunications Conference. Conference Record.

[16]  L. Wuttisittikulkij,et al.  Design of a WDM network using a multiple ring approach , 1997, GLOBECOM 97. IEEE Global Telecommunications Conference. Conference Record.

[17]  Biswanath Mukherjee,et al.  A Practical Approach for Routing and Wavelength Assignment in Large Wavelength-Routed Optical Networks , 1996, IEEE J. Sel. Areas Commun..

[18]  Kyungsik Lee,et al.  Optimal routing and wavelength assignment in WDM ring networks , 2000, IEEE Journal on Selected Areas in Communications.