By Topic

An optimal wavelength assignment algorithm to minimize the number of SONET ADMs in WDM rings

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)
Ambuj, S.J. ; Indian Inst. of Manage., Calcutta, India ; Saha, M.D. ; Sadgukhan, S.K.

In WDM rings, determining minimum number of ADMs is NP-hard. The best known algorithm namely, breadth first least interference (BFLI) heuristic gives optimal results in only 77% cases. In this paper, we analyze the problem and suggest a new set covering formulation for minimizing the number of ADMs in WDM rings and propose a new generic search algorithm namely uninformed best first search (UBFS) algorithm. UBFS always returns an optimal solution. We show through experiments that UBFS solves moderate sized problems in reasonable amount of execution time. We show that the output of BFLI heuristic is input order dependent. We make detailed error analysis of BFLI and suggest a modified BFLI which is input order independent and on the whole performs at least as good as BFLI.

Published in:

Wireless and Optical Communications Networks, 2005. WOCN 2005. Second IFIP International Conference on

Date of Conference:

6-8 March 2005