By Topic

Time-efficient near-optimal wavelength assignment in dynamically-reconfigurable WDM 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
$33 $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

2 Author(s)
Quang-Dzung Ho ; Opt. Internet Res. Center, Inf. & Commun. Univ., Daejeon, South Korea ; Man-Seop Lee

In wavelength-routed optical networks (WRONs), wavelength converters are considered as one of the most critical resources because they can significantly reduce the blocking probability but still remain quite expensive. Therefore, the problem of dynamic wavelength assignment that can optimally utilize converters is strongly desired. Unfortunately, previously proposed algorithms are impractical due to their huge computational complexities. In this paper, perhaps for the first time, we formulate this problem as an integer linear program (ILP) and solve it by a novel heuristics, called first-longest lambda-run algorithm (FLR). Our algorithm establishes a lightpath by chaining a minimum number of wavelength-continuous segments, called lambda-runs. The simulations in the NSFNET with different conversion capabilities show that more than 98% of lightpaths determined by FLR are optimal. As a result, FLR can significantly improve the network blocking performance, compared to first-fit algorithm. Especially, our algorithm is very time-efficient and easy to implement.

Published in:

HPSR. 2005 Workshop on High Performance Switching and Routing, 2005.

Date of Conference:

12-14 May 2005