...
首页> 外文期刊>IEICE Transactions on Communications >Optimal Multicast Routing Using Genetic Algorithm for WDM Optical Networks
【24h】

Optimal Multicast Routing Using Genetic Algorithm for WDM Optical Networks

机译:WDM光网络中基于遗传算法的最佳组播路由

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

摘要

We consider the multicast routing problem for large-scale wavelength division multiplexing (WDM) optical networks where transmission requests are established by point-to-multipoint connections. To realize multicast routing in WDM optical networks, some nodes need to have light (optical) splitting capability. A node with splitting capability can forward an incoming message to more than one output link. We consider the problem of minimizing the number of split-capable nodes in the network for a given set of multicast requests. The number of wavelengths is fixed and given a priori. We propose a genetic algorithm that exploits the combination of alternative shortest paths for the given multicast requests in order to minimize the number of required split-capable nodes. This algorithm is examined for two realistic networks constructed based on the locations of major cities in Ibaraki Prefecture and those in Kanto District in Japan. Our experimental results show that the proposed algorithm can reduce more than 10% of split-capable nodes compared with other routing algorithms whereby the optimization for the split-capable node placement is not taken into account.
机译:我们考虑大规模波分复用(WDM)光网络的多播路由问题,在该网络中,传输请求是通过点对多点连接建立的。为了在WDM光网络中实现多播路由,某些节点需要具有光(光)分离功能。具有拆分功能的节点可以将传入消息转发到多个输出链接。对于一个给定的多播请求集,我们考虑使网络中可拆分节点的数量最小化的问题。波长的数量是固定的,并且是先验的。我们提出一种遗传算法,该算法利用给定多播请求的替代最短路径的组合,以最大程度地减少所需的可拆分节点的数量。针对基于茨城县主要城市和日本关东地区的主要城市的位置构建的两个现实网络,研究了该算法。我们的实验结果表明,与其他路由算法相比,该算法可减少可拆分节点的10%以上,从而不考虑可拆分节点布局的优化问题。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号