一种基于最佳优先搜索的最佳波长分配算法，以最小化WDM环中SONET adm的数量

Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005. Pub Date : 2005-10-31 DOI:10.1109/ICCCN.2005.1523954

Sethuraman Janardhanan, A. Mahanti, Debashis Saha, S. Sadhukhan

{"title":"一种基于最佳优先搜索的最佳波长分配算法，以最小化WDM环中SONET adm的数量","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":"{\"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}","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

摘要

在WDM环中，确定最小adm数量是np困难的。最著名的启发式算法即广度优先最小干扰(BFLI)启发式算法仅在77%的情况下给出最优结果。本文对该问题进行了分析，提出了一种新的集覆盖公式，用于最小化WDM环中adm的数量，并利用启发式算法(h/sub LB/)的最佳优先搜索算法(a *)进行了最优求解。通过实验证明，启发式函数(h/sub LB/)的搜索算法优于BFLI，总能给出最优结果。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A best first search based optimal wavelength assignment algorithm to minimize the number of SONET ADMs in WDM rings

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.

自引率

0.00%

发文量