首页 | 本学科首页   官方微博 | 高级检索  
     检索      

一种解多QoS约束组播问题的改进蚁群算法
引用本文:石钊,葛连升.一种解多QoS约束组播问题的改进蚁群算法[J].山东大学学报(理学版),2007,42(9):41-45.
作者姓名:石钊  葛连升
作者单位:1. 山东大学,计算机科学与技术学院,山东,济南,250061
2. 山东大学,计算机科学与技术学院,山东,济南,250061;山东大学,网络中心,山东,济南,250100
摘    要:多QoS约束的组播路由技术是当前实现分布式网络多媒体的关键技术,蚁群算法是解决多QoS约束组播路由问题的一种启发式算法,但存在收敛速度慢等缺陷. 基于这种情况提出了一种改进的蚁群算法,该算法采用基于组成员节点驱动的方式构造组播树,并在概率转移函数中添加了方向因子,使蚂蚁在寻找路径时摆脱了最初的盲目性,以更大的概率快速向源节点靠近. 仿真实验证明,改进蚁群算法的收敛速度明显提高.

关 键 词:蚁群算法  组播路由  方向因子  服务质量(QoS)
文章编号:1671-9352(2007)09-0041-05
修稿时间:2007-03-25

Modified ant colony algorithm for the multi-QoS constraint multicast routing problem
SHI Zhao,GE Lian-sheng.Modified ant colony algorithm for the multi-QoS constraint multicast routing problem[J].Journal of Shandong University,2007,42(9):41-45.
Authors:SHI Zhao  GE Lian-sheng
Institution:1. Sehool of Computer Science and Technology, Shandong University, Jinan 250061, Shandong, China; 2.Network Center, Shandong University, Jinan 250100, Shandong, China
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 gToup-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.
Keywords:ant colony algorithm  multicast routing  orientation factor  quality of service (QoS)
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《山东大学学报(理学版)》浏览原始摘要信息
点击此处可从《山东大学学报(理学版)》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号