期刊文献+

一种基于蚁群系统的组播路由算法

A Multicast Routing Algorithm Based on Ant Colony System
下载PDF
导出
摘要 提出一种基于蚁群系统的求解QoS(quality of service)组播路由问题的新算法.算法中控制参数及路由选择策略根据迭代过程所处的不同阶段自适应调整.综合考虑QoS路由中所有约束条件的同时,也充分考虑各个约束自身的独立特性.实验证明算法所得的解不但较高程度地满足各个约束条件,而且多样性好、收敛速度快,能满足实际网络服务质量要求.* A new QoS ( quality of service) muhieast routing problem based on ant colony algorithm is presented. The route selection strategy and the control parameters of the ant colony are adjusted adaptively in different iteration steps. It makes comprehensive eonsideration of all the constraints of QoS routing problem, and takes into account the individual characteristics of each constraint. Experimental results show that this algorithm has a higher fitness to the constraints and gets much more diversified solutions and higher convergence speed; it can meet the service quality requirement in real network.
出处 《信息与控制》 CSCD 北大核心 2006年第5期545-550,共6页 Information and Control
基金 国家自然科学基金资助项目(60473012) 国家科技发展基金资助项目(2003BA614A-14) 江苏省自然科学基金资助项目(BK2005047)
关键词 组播 路由 蚁群 muhieast routing ant colony
  • 相关文献

参考文献7

  • 1Ballardie T,Francis P,Crowcroft J.Core based trees(CBT) an architecture for scalable inter-domain multicast routing[A].Proceedings of the ACM SIGCOMM'93 Conference on Communications Architectures,Protocols and Applications[C].NY,USA:ACM,1993.85~95.
  • 2Kou L,Markowsky G,Berman L.A fast algorithm for Steiner trees[J].Acta Informatica,1981,15(2):141~145.
  • 3Wang B,Hou J C.Multicast routing and its QoS extension:problem,algorithms and protocols[J].IEEE Network,2000,14(1):22~35.
  • 4Low C P,Wang N.Efficient algorithm for group multicast routing with bandwidth reservation[J].Computer Communications,2000,23(18):1740~1746.
  • 5Wang Z,Crowcrofi J.Quality of service routing for supporting multimedia applications[J].IEEE Journal on Selected Areas in Communications,1996,14(7):1228~1234.
  • 6胡光岷,李乐民,安红岩.带宽预留的成组多播快速路由算法[J].电子学报,2003,31(4):569-572. 被引量:4
  • 7王征应,石冰心.基于启发式遗传算法的QoS组播路由问题求解[J].计算机学报,2001,24(1):55-61. 被引量:82

二级参考文献14

  • 1Bin Wang, Jennifer C Hou. Multicast routing and its QoS extension:problem, algorithms and protocols [ J ]. IEEE Network, January/February, 2000, 14(1 ) :22 - 35,.
  • 2Bernard M Waxman. Routing of multipoint connectiom [J]. IEEE journal on selected area in communication, 1988,6(9):1617- 1622.
  • 3Paolo Narvaez, Kai-Yeung Siu, Hong-Yi Tzeng. New dynamic algorithms for shortest path tree computation [J]. IEEE/ACM Transactions on Networking, 2000,8 (6) : 734 - 746.
  • 4T Ballardie, P Francis,J Crowcroft. Core based trees (CBT) [A] .Proceedings of the ACM SIGCOMM'93 Conference on Communications Architectures, Protocols and Applications [C]. San Francisco 1993 : 85- 95,.
  • 5L Kou, G Markowsky, L Berman. A fast algorithm for Steiner trees [J].Acta Informatica 1981,15( 1 ) : 141 - 145.
  • 6X Jia, L Wang. Group multicast routing algorithm by using multiple minimun Steiner trees [J]. Computer Communications, 1997, 20(4):750 - 758.
  • 7H Takahashi, A Matsuymna, An approximate solution for the Steiner problem in graphs [J]. Mathematica Japonica, 1980,6(3) : 573 - 577.
  • 8C P Low, N Wang. An efficient algorithm for group multicast routing with bandwidth reservation [ J ]. Computer Communication, 2000, 23(8) : 1740 - 1746.
  • 9Zhang Q,IEEE Trans Evolutionary Computation,1999年,3卷,1期,53页
  • 10Sun Q,Technical Report IBRTU Braunschweig Butenweg 74/ 75 3810 6 Braunschweig,1999年

共引文献83

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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