• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Optical fiber technology >An improved least cost routing approach for WDM optical network without wavelength converters
【24h】

An improved least cost routing approach for WDM optical network without wavelength converters

机译：没有波长转换器的WDM光网络的一种改进的成本最低的路由方法

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Routing and wavelength assignment (RWA) problem has been an attractive problem in optical networks, and consequently several algorithms have been proposed in the literature to solve this problem. The most known techniques for the dynamic routing subproblem are fixed routing, fixed-alternate routing, and adaptive routing methods. The first one leads to a high blocking probability (BP) and the last one includes a high computational complexity and requires immense backing from the control and management protocols. The second one suggests a trade-off between performance and complexity, and hence we consider it to improve in our work. In fact, considering the RWA problem in a wavelength routed optical network with no wavelength converter, an improved technique is proposed for the routing subproblem in order to decrease the BP of the network. Based on fixed-alternate approach, the first k shortest paths (SPs) between each node pair is determined. We then rearrange the SPs according to a newly defined cost for the links and paths. Upon arriving a connection request, the sorted paths are consecutively checked for an available wavelength according to the most-used technique. We implement our proposed algorithm and the least-hop fixed-alternate algorithm to show how the rearrangement of SPs contributes to a lower BP in the network. The numerical results demonstrate the efficiency of our proposed algorithm in comparison with the others, considering different number of available wavelengths. (C) 2016 Elsevier Inc. All rights reserved.
机译：路由和波长分配（RWA）问题一直是光网络中的一个有吸引力的问题，因此，文献中提出了几种算法来解决该问题。动态路由子问题最著名的技术是固定路由，固定备用路由和自适应路由方法。第一个导致较高的阻塞概率（BP），最后一个导致较高的计算复杂度，并且需要控制和管理协议的巨大支持。第二个建议在性能和复杂性之间进行权衡，因此我们认为它可以改善我们的工作。实际上，考虑到没有波长转换器的波长路由光网络中的RWA问题，提出了一种改进的路由子问题技术，以降低网络的BP。基于固定备用方法，确定每个节点对之间的前k个最短路径（SP）。然后，我们根据链接和路径的新定义成本重新排列SP。到达连接请求后，将根据最常用的技术连续检查分类路径的可用波长。我们实现了我们提出的算法和最小跳固定替代算法，以显示SP的重排如何有助于降低网络中的BP。数值结果证明了我们提出的算法与其他算法相比的效率，其中考虑了可用波长的不同数量。 （C）2016 Elsevier Inc.保留所有权利。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号