Sethuraman Janardhanan, A. Mahanti, Debashis Saha, S. Sadhukhan
{"title":"A best first search based optimal wavelength assignment algorithm to minimize the number of SONET ADMs in WDM rings","authors":"Sethuraman Janardhanan, A. Mahanti, Debashis Saha, S. Sadhukhan","doi":"10.1109/ICCCN.2005.1523954","DOIUrl":null,"url":null,"abstract":"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 use best first search algorithm (A*) with the help of a heuristic (h/sub LB/) to solve it optimally. We establish through experiments that the search algorithm with the heuristic function (h/sub LB/) performs better than BFLI by always giving optimal results.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCN.2005.1523954","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
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 use best first search algorithm (A*) with the help of a heuristic (h/sub LB/) to solve it optimally. We establish through experiments that the search algorithm with the heuristic function (h/sub LB/) performs better than BFLI by always giving optimal results.