By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Valavi, J. ; Dept. of Electr. & Comput. Eng., Colorado Univ., Boulder, CO, USA ; Saluja, N. ; Khatri, S.P.

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.

Published in:

Communications, 2005. ICC 2005. 2005 IEEE International Conference on  (Volume:3 )

Date of Conference:

16-20 May 2005