首页> 外文会议>IASTED International Conference on Communications and Computer Networks >A HEURISTIC SEARCH BASED OPTIMAL WAVELENGTH ASSIGNMENT ALGORITHM TO MINIMIZE THE NUMBER OF SONET ADMS IN WDM RINGS
【24h】

A HEURISTIC SEARCH BASED OPTIMAL WAVELENGTH ASSIGNMENT ALGORITHM TO MINIMIZE THE NUMBER OF SONET ADMS IN WDM RINGS

机译:基于启发式搜索的最佳波长分配算法,以最大限度地减少WDM环中SONET ADM的数量

获取原文

摘要

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 two heuristics namely H-Ⅰ and H-Ⅱ to solve it . Heuristic H-Ⅰ is an admissible heuristic and can always ensure optimal result where as H-Ⅱ is an inadmissible heuristic which gives optimal results in most of the cases. We establish through experiments that the search algorithm with the proposed heuristic functions (H-Ⅰ & H-Ⅱ) performs better than BFLI.
机译:在WDM环中,确定最小数量的ADM是NP-HARD。最着名的算法即,广度最少干扰(BFLI)启发式在77%的情况下提供最佳结果。在本文中,我们分析了问题,并提出了一种新的集合覆盖配方,以最大限度地减少WDM环中的ADM数量,并在两个启发式中使用最佳的第一搜索算法(A〜*)即H-Ⅰ和H-Ⅱ解决它。启发式H-Ⅰ是一个可接受的启发式,可以始终确保最佳结果,因为H-Ⅱ是一种不允许的启发式,在大多数情况下提供最佳结果。我们通过实验确定,搜索算法具有拟议的启发式功能(H-Ⅰ和H-Ⅱ)的表现优于BFLI。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号