By Topic

Time-efficient optimal wavelength assignment in optical WDM networks with conversion capability

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

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), a wavelength assignment algorithm which can optimally utilize wavelength converters is strongly desired. In this letter, for the first time, we propose a novel graph constructed with groups of available wavelengths, called lambda-runs, to obtain the least-conversion lightpaths easily by applying the shortest-path routing Dijkstra's algorithm. Simulations show that our algorithm is much more scalable than an existing optimal algorithm, and significantly improves the blocking performance, compared to modified first-fit algorithm.

Published in:

Communications Letters, IEEE  (Volume:10 ,  Issue: 3 )