作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2007, Vol. 33 ›› Issue (11): 206-208,. doi: 10.3969/j.issn.1000-3428.2007.11.075

• 人工智能及识别技术 • 上一篇    下一篇

基于蚁群系统WDM网络受限组播路由算法

谢春光1,祝军生2,陈胜权3   

  1. (1. 桂林电子科技大学计算机科学系,桂林 541004;2. 中国电子科技集团第三十四研究所,桂林 541004; 3. 桂林航天工业高等专科学校,桂林 541004)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-06-05 发布日期:2007-06-05

Ant Colony System-based WDM Networks Constraint Multicast Routing Algorithm

XIE Chunguang1, ZHU Junsheng2, CHEN Shengquan3   

  1. (1. Department of Computer Science, Guilin University of Electronic Technology, Guilin 541004; 2. No.34 Research Institute, China Electronics Technology Group, Guilin 541004; 3. Guilin College of Aerospace Technology, Guilin 541004)
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-06-05 Published:2007-06-05

摘要: 通过在蚂蚁选路的概率中加入成本因素,只增加优秀路径上的信息素,实现了对现有蚁群算法的改进,加快了其收敛速度。将改进的蚁群优化算法与分层图相结合,提出了一种构造时延受限的最小代价组播树的并行算法。

关键词: 蚁群算法, WDM网络, 组播树, 并行算法

Abstract: By adding cost factor of probability in ants election path, and increasing only the fine quality of information, this paper improves the existing ant colony algorithm to speed up its convergence speed. Combining the improved ant colony optimization algorithms and the tiered plan, it presents a parallel algorithm for constructing minimum price multicast trees under transmission constraints.

Key words: Ant colony algorithm, WDM network, Multicast tree, Parallel algorithms

中图分类号: