首页> 外文期刊>Advances in computational sciences and technology >An Efficient Algorithm to Find the Best Optimal Path in WDM Optical Networks
【24h】

An Efficient Algorithm to Find the Best Optimal Path in WDM Optical Networks

机译:WDM光网络中寻找最佳路径的有效算法

获取原文
获取原文并翻译 | 示例
           

摘要

In this paper, we propose an approach to solve the optimal path selection problem in optical networks based on WDM. The approach considers service-specific path quality attributes, such as transmission quality degradation and number of residual wavelengths. The idea of this approach based on modifying FLOYD's all-pairs shortest path algorithm to solve the optimal path problem with less number of iterations through the searching process. Also, we show that the approach is more efficient to find the best optimal path between given source and destination nodes, which is impractical for networks with large number of nodes.
机译:在本文中,我们提出了一种解决基于WDM的光网络中最佳路径选择问题的方法。该方法考虑了特定于服务的路径质量属性,例如传输质量下降和剩余波长数。这种方法的思想基于修改FLOYD的全对最短路径算法,以通过搜索过程以较少的迭代次数来解决最佳路径问题。而且,我们表明,该方法在给定源节点和目标节点之间找到最佳最佳路径的效率更高,这对于具有大量节点的网络是不切实际的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号