您的位置:山东大学 -> 科技期刊社 -> 《山东大学学报(理学版)》

J4

• 论文 • 上一篇    下一篇

一种解多QoS约束组播问题的改进蚁群算法

石 钊1,葛连升1,2*   

  1. 1. 山东大学计算机科学与技术学院, 山东 济南 250061; 2. 山东大学网络中心, 山东 济南 250100
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2006-10-24 发布日期:2006-10-24
  • 通讯作者: 石 钊

Modified ant colony algorithm for the multi-QoS constraint multicast routing problem

SHI Zhao1,GE Lian-sheng1,2*   

  1. 1. School of Computer Science and Technology, Shandong University, Jinan 250061, Shandong;2.Network Center, Shandong University, Jinan 250100, Shandong, China
  • Received:1900-01-01 Revised:1900-01-01 Online:2006-10-24 Published:2006-10-24
  • Contact: SHI Zhao

摘要: 多QoS约束的组播路由技术是当前实现分布式网络多媒体的关键技术,蚁群算法是解决多QoS约束组播路由问题的一种启发式算法,但存在收敛速度慢等缺陷. 基于这种情况提出了一种改进的蚁群算法,该算法采用基于组成员节点驱动的方式构造组播树,并在概率转移函数中添加了方向因子,使蚂蚁在寻找路径时摆脱了最初的盲目性,以更大的概率快速向源节点靠近. 仿真实验证明,改进蚁群算法的收敛速度明显提高.

关键词: 蚁群算法, 组播路由, 服务质量(QoS) , 方向因子

Abstract: The multicast routing technology with multi-QoS constraint is the key for distributed multimedia on the network. The ant colony algorithm is one of the best algorithms for solving the multicast routing problem with multi-QoS constraint, but it takes too much time to converge. Therefore, a modified ant colony algorithm was proposed. This new algorithm adopts the group-member-node-driven method to create the tree and adds the orientation factor to the probability function, which enables the ant to get rid of the initial blindness when searching paths. The simulation results show that the new algorithm can rapidly converge.

Key words: quality of service (QoS) , orientation factor, multicast routing, ant colony algorithm

中图分类号: 

  • TP393
[1] 万智萍1,吕志民1,2*. 一种自适应物种寻优的无线Mesh网络QoS路由算法[J]. J4, 2013, 48(09): 10-16.
[2] 王另秀,曹叶文*. 基于蚁群算法的多源组播流量均衡的研究[J]. J4, 2011, 46(11): 28-32.
[3] 葛连升1,周加强2,秦丰林1. 基于交叉熵的多约束QoS组播路由蚂蚁算法[J]. J4, 2010, 45(5): 35-41.
[4] 葛连升 江林 秦丰林. QoS组播路由算法研究综述[J]. J4, 2010, 45(1): 55-65.
[5] 孙永征,刘 亮 . 基于混合行为蚁群算法的股票市场投资者行为模拟[J]. J4, 2007, 42(6): 35-40 .
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!