首页> 外文期刊>Systems and Computers in Japan >Proposal of a Hierarchical Heuristic Algorithm for Node Assignment in Bidirectional Manhattan Street Networks
【24h】

Proposal of a Hierarchical Heuristic Algorithm for Node Assignment in Bidirectional Manhattan Street Networks

机译:双向曼哈顿街道网络中节点分配的分层启发式算法的建议

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

摘要

In wavelength division multiplexing (WDM) technology, high-speed large-capacity communication is realized by transmitting multiple optical signals with different wavelengths in parallel on an optical fiber. In WDM technology, the logical topology of the network can generally be modified by changing the wavelength assignment to the transmitters and receivers. Thus it is important to develop an algorithm that derives the wavelength assignment that maximizes the transmission efficiency of the network. This paper considers a bidirectional Manhattan street network which has a regular topology, and proposes a hierarchical two-stage heuristic algorithm. In the first stage, the initial solution is derived by hierarchical region division and node assignment to the regions. In the second stage, the solution is improved by simulated annealing (SA). The proposed algorithm is evaluated by simulations of random instances and instances for which optimal solutions are already known. The effectiveness of the proposed algorithm is demonstrated through comparisons to the existing one.
机译:在波分复用(WDM)技术中,通过在光纤上并行传输具有不同波长的多个光信号来实现高速大容量通信。在WDM技术中,通常可以通过更改发送器和接收器的波长分配来修改网络的逻辑拓扑。因此,重要的是开发一种算法,该算法可得出使网络传输效率最大化的波长分配。本文考虑了具有规则拓扑结构的双向曼哈顿街道网络,并提出了一种分层的两阶段启发式算法。在第一阶段,初始解决方案是通过分层区域划分和将节点分配给区域而得出的。在第二阶段,通过模拟退火(SA)改进解决方案。通过模拟随机实例和已知最佳解决方案的实例来评估所提出的算法。通过与现有算法的比较证明了该算法的有效性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号