期刊文献+

一种基于蚁群算法的动态组播QoS路由算法

Dynamic multicast QoS routing algorithm based on ant colony algorithm
下载PDF
导出
摘要 提出了一种基于蚁群算法的满足带宽、时延、时延抖动、分组丢包率、费用多个QoS约束的动态组播路由算法(DM-ACA)。该算法使用逆向路径(Reverse path)机制,蚂蚁从目的节点出发寻找源节点,解决了组播网络动态变化的问题;通过引入洪泛(flooding)机制,初始群筛选(sieving)机制,加性增量乘性减量(AIMD)的信息素启发机制,解决了蚁群算法局部搜索能力弱、收敛速度慢、易于陷入局部最优解的问题。仿真结果表明,提出的算法可行有效。 Based on ant colony algorithm (ACA), a dynamic multicast QoS routing algorithm (DM-ACA) was presented for satisfying multiple constraints, such as bandwidth, delay, delay-jitter, package lost rate and cost. The algorithm uses a mechanism of reverse path to solve the problem of dynamic change of multicast network: ants start form destination to source node. Also, mechanisms as flooding, sieving of initial group, add-kind increment and multiply-kind decrease pheromone updating rule are put forward to resolve the problems of ACA, such as enhancing the ability of local searching, improving speed of constringency, avoiding trapped in local optimum. Simulation resuits showed that the proposed algorithm was feasible and effective.
出处 《重庆邮电大学学报(自然科学版)》 2007年第B06期92-95,共4页 Journal of Chongqing University of Posts and Telecommunications(Natural Science Edition)
基金 北京市教委学科建设与研究生教育项目(XK100130548)
关键词 蚁群算法 动态组播 QOS 路由算法 ant colony algorithm (ACA) dynamic multicast QoS routing algorithm
  • 相关文献

参考文献3

二级参考文献18

  • 1YUANYouwei YANLamei.QoS-Based Dynamic Multicast Routing Design Using Genetic Algorithms[J].Chinese Journal of Electronics,2004,13(4):575-578. 被引量:3
  • 2韩晓莉,刘鸿,李熊达.宽带IP网QoS中的性能参数及网络有效性分析模型[J].重庆邮电学院学报(自然科学版),2005,17(3):344-346. 被引量:5
  • 3Schoonderwoerd R, Hoolland O, Bruten J. Ant-based Load Balancing in Telecommunications Networks [ J ]. Adaptive Behavior, 1996, 5(2) :169-207.
  • 4Dorigo M, Gambardella L M. Ant Colony System: A Cooperative Learning Approach to the Travelling Salesman Problem [ J ]. IEEE Trans on Evolutionary Computation, 1997,1 ( 1 ) :53-66.
  • 5Dorigo M, Di Caro G. Ant Colony Optimization:A New Meta-Heuristic [ C ]. Washington DC: Proceedings of the Evolutionary Computation,1999. 1470-1477.
  • 6MIEGHEM P, NEVE H, KUIPERS F.Hop-by hop Quality of Service Routing[J].Computer Nelworks,2001,37(3):407-423.
  • 7WANG B, HOU J. Multicast routing and its QoS Exlension: Problems, Algorilhms, and Protocols[J]. IEEE Network,2000,14(1): 22-36.
  • 8CHO Jaihyung, BREEN James. Is a Steiner Tree the optimal multicast model? [EB/OL]. [2005-05-11]. http://citeseer. ist. psu.edu/19099.html.
  • 9HUANG Jia qing, DU Xu, YANG Zong-kai,et al. Available bandwidth-based real-time muhicast routing distributed algorithm[EB/OL]. (2003-10-23)[2005-04-12]. http.//ieeexplore. ieee. org/ie15/8807/27858/01243027. pdf.
  • 10HUANG Jia-qing,YANG Zong kai,DU Xu ,et al. Available bandwidth-based real-time multicast routing with constraints of delay and delay variation [EB/OL] (2003-06-23)[2005-04-13]. http.//ieeexplore. ieee. org/ie15/8474/26699/01191287.pdf? arnumber=1191287.

共引文献13

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部