• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Symposium on Intelligence Computation amp; Applications(ISICA'2007); 20070921-23; Wuhan(CN) >A Two-Stage Genetic Algorithm for the Multi-multicast Routing
【24h】

A Two-Stage Genetic Algorithm for the Multi-multicast Routing

机译：多阶段路由的两阶段遗传算法

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

摘要

The multi-multicast routing problem is to find a set of multicasts which allows transmission and routing of packets from many sources to many destinations. Due to the amount of residual bandwidth of a link, the problem becomes complicated. This paper presents an approach to solve the problem based on a two-stage genetic algorithm. The problem is decomposed into two objectives, the primary objective is to find a multicast group from a source to its destinations satisfied bandwidth and delay constraints, and the secondary objective is to find an optimal combinatorial solution in all multicasts. For the objectives, two evolving modules are designed. In the first module a method of encoding tree-like chromosome, and corresponding crossover and mutation operator are presented. The numerical simulation shows that the algorithm is efficient to solve the multi-multicast routing problem.
机译：多播路由问题是找到一组组播，该组播允许将数据包从许多源传输到许多目的地并进行路由。由于链路的剩余带宽量，问题变得复杂。本文提出了一种基于两阶段遗传算法的解决方案。该问题分解为两个目标，主要目标是找到从源到其目的地的满足带宽和延迟约束的组播组，次要目标是在所有组播中找到最佳组合解决方案。为了实现目标，设计了两个不断发展的模块。在第一个模块中，提出了一种编码树状染色体的方法以及相应的交叉和变异算子。数值仿真表明，该算法是解决多播路由问题的有效方法。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号