期刊文献+

基于蚁群优化的分布式Qos多播路由方法研究 被引量:3

Study on distributed QoS multicast routing based on ant colony optimization algorithm
下载PDF
导出
摘要 提出了一种基于蚁群优化的分布式QoS多播路由算法,蚁群算法是解决多QoS约束组播路由问题的一种启发式算法,多QoS约束的组播路由技术是当前实现分布式网络多媒体的关键技术。给出了该算法实现的步骤,还结合多播路由问题的特点对算法进行了改进。通过仿真实验讨论了该方法的性能,并与传统的蚁群算法对比,证实了该方法的有效性。 A novel distributed multicast routing algorithm based on ACO with quality of service (QoS) is proposed. The ant colony algorithm is one of the best algorithms for solving the multicast routing problem with multi-QoS constraint, the multicast routing technology with multi-QoS constraint is the key for distributed multimedia on the network. The steps of the algorithm is given. Combining the characteristics ofmulticast routing, the algorithm is improved. Comparing with the traditional ant colony algorithm, the simulation results of the paper show that the new algorithm is valid and effective.
出处 《计算机工程与设计》 CSCD 北大核心 2009年第5期1107-1109,共3页 Computer Engineering and Design
基金 湖南省教育厅科学研究基金项目(05C739)。
关键词 蚁群优化 多播路由 服务质量 网络多媒体 多QOS约束 ant colony optimization multicast routing quality of service network mutimedia multi-QoS constraint
  • 相关文献

参考文献9

  • 1Braudes R, Zabele S.Requirements for multicast protocols [C]. Interact Engineering Task Force, RFC 1458,1993.
  • 2Vachaspathi P Kompella,Joseph C Pasquale,George C Polyzos. Multicasting for multimedia applications[C]. Proceeding of Eleventh Annual Joint Conference of the IEEE Computer and Communications Societies. Florence, Italy: IEEE Computer Society Press, 1992:2078-2085.
  • 3Marco Dorigo, LucaMaria Gambardella.Ant colony system: A cooperative learning approach to the traveling salesman problem [J].IEEE Tran on Evolutionary Computation, 1997(1):53-56.
  • 4李腊元,李春林.动态QoS多播路由协议[J].电子学报,2003,31(9):1345-1350. 被引量:40
  • 5Gene Connolly, George Markowsky, Anatoly Sachenko. Distributed traceroute approach to geographically locating IP Devices [C].Proceedings of Spring IEEE Conference on Technologies for Homeland Security.Boston,USA:IEEE Computer Society Press, 2003:128-131.
  • 6吴斌,史忠植.一种基于蚁群算法的TSP问题分段求解算法[J].计算机学报,2001,24(12):1328-1333. 被引量:247
  • 7Parsa M, Zhu Q. An iterative algorithm for delay -constrained minimum-cost multicasting [J]. IEEE Transactions on Networking, 1998,6(4):461-474.
  • 8Kou L,Markowsky G,Berman L.A fast algorithm for Steiner tree [J].Acta Information,1981,15(2):141-145.
  • 9CHU Chao-Hsien,GU JunHua,HOU XiangDan,et al.A heuristic ant algorithm for solving QoS multicast routing problem [C]. Proc of the IEEE Congress on Evolutionary Computation.Honolulu,HI,USA:IEEE Computer Society Press,2002:1630-1635.

二级参考文献14

  • 1康立山 谢云 等.非数值并行算法(第1册)[M].北京:科学出版社,1997..
  • 2Li layuan Li Chunlin(李腊元 李春林).Computer Networking(计算机网络技术)[M].Beijing:National Defence Industry Press(北京:国防工业出版社),2001..
  • 3A Ballardie. Core Based Trees(CBT Version 2)Multicast Routing:Protocol Specification[ R] .IETF USA:RFC2189, Septermber 1997.
  • 4S Deering, D Estrin, D Farinacci, V Jacobson, C Liu, L Wei.The PIM architecture for wide-area multicast muting[J]. IEEE/ACM Transaction on Networking, 1996,4(2) : 153 - 162.
  • 5K Carberg,J Crowcroft,Building shared trees using a one-to-marry joining mechanism[J].ACM Computer Communication Review,1997(1):5-11.
  • 6T Ballardie,P Francis,J Crowcroft.An architecture for scalable interdomain multicast routing[J].ACM SIGCOMM, 1993(9) : 85 - 95.
  • 7Li Layuan, Li ChunLin, The QoS routing algorithm for ATM networks[J]. Computer Communications, 2001,24(3 - 4) :416 - 421.
  • 8Li Layuan. A formal specification technique for communication protocol[A] .Proc of IEEE INFOCOM[ C]. USA: IEEE CS Press, 1989.74-81.
  • 9X Jia. A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks[J]. IEEE/ACM Transactions on Networking, 1998,6(6) :828 - 837.
  • 10Jiang Rui,Proc Conference on Intelligent Information Processing(WCC 2000 IIP 2000),2000年,478页

共引文献283

同被引文献13

引证文献3

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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