期刊文献+

网络多播路由优化与仿真研究 被引量:2

Simulation on Multicast Routing Optimizing Algorithms
下载PDF
导出
摘要 研究网络多播路由优化问题,由于网络数据流要求实时性和准确性,而网络多播路由是一个多约束条件的复杂问题,传统优化算法对其进行求解耗时长,效率低,难以找到最优路由。为了快速找到最优多播路由,提出了一种人工免疫-蚂蚁算法的多播路由优化方法。人工免疫-蚂蚁算法首先将多播路由的目标函数和约束条件作为抗原,目标函数的优化解作为抗体,通过人工免疫算法生成蚁群算法的初始信息素分布,以多播路由解的收敛方向,然后利用蚁群算法产生和更新抗体求得多播路由优化解。仿真结果表明,相对于其它优化算法,人工免疫-蚂蚁算法该算法的多播路由优化效率更高,能快速、有效地找到多约束条件的最优多播路由。 Research on the network multicast routing optimization problems.In ant colony algorithm in solving the network multicast routing problem,initial pheromone shortage results in the defects of slow convergence speed and falling into local optimals.The paper put forward an artificial immune-ant algorithm's network multicast routing optimization method.First,the artificial immune-ant algorithm took the target function and constraints of multicast routing as the antigen,and objective function optimization solution as the antibody,through artificial immune algorithm,produced ant colony algorithm for initialization pheromone distribution,to control the solving process of convergence direction.Then the ant colony algorithm was used to produce and update antibodies obtained netowrk multicast routing optimization solution.Simulation results show that the artificial immune-ant algorithm can quickly find satisfying delay constraint and bandwidth request the minimum cost routing,and improve the network multicast routing selection efficiency.
作者 师东生
出处 《计算机仿真》 CSCD 北大核心 2011年第10期111-114,共4页 Computer Simulation
基金 J2EE架构下中间件的开发与应用研究(20080404MS0910)
关键词 蚁群算法 多播路由 人工免疫算法 Ant colony algorithm Multicast routing Artificial immune algorithm
  • 相关文献

参考文献6

二级参考文献28

  • 1Li layuan Li Chunlin(李腊元 李春林).Computer Networking(计算机网络技术)[M].Beijing:National Defence Industry Press(北京:国防工业出版社),2001..
  • 2A Ballardie. Core Based Trees(CBT Version 2)Multicast Routing:Protocol Specification[ R] .IETF USA:RFC2189, Septermber 1997.
  • 3S 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.
  • 4K Carberg,J Crowcroft,Building shared trees using a one-to-marry joining mechanism[J].ACM Computer Communication Review,1997(1):5-11.
  • 5T Ballardie,P Francis,J Crowcroft.An architecture for scalable interdomain multicast routing[J].ACM SIGCOMM, 1993(9) : 85 - 95.
  • 6Li Layuan, Li ChunLin, The QoS routing algorithm for ATM networks[J]. Computer Communications, 2001,24(3 - 4) :416 - 421.
  • 7Li Layuan. A formal specification technique for communication protocol[A] .Proc of IEEE INFOCOM[ C]. USA: IEEE CS Press, 1989.74-81.
  • 8X 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.
  • 9Schoonderwoerd R, Hoolland O, Bruten J. Ant-based Load Balancing in Telecommunications Networks [ J ]. Adaptive Behavior, 1996, 5(2) :169-207.
  • 10Dorigo 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.

共引文献160

同被引文献6

引证文献2

二级引证文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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