期刊文献+

基于蚁群算法的理性自适应路由研究 被引量:2

Research of Rationally Adaptive Routing Based on Ant Colony Algorithms
下载PDF
导出
摘要 动态路由是随着网络动态拓扑结构和通信流量的变化而自动调整的过程,其性能的优劣对整个网络的性能至关重要。本文介绍了基于蚁群算法对动态路由问题进行优化的理性研究,采用蚁群优化算法搜集网络最新信息,通过改进选择策略,动态更新路由表项和节点状态信息,解决网络的负载均衡问题,提高网络性能。 With the changes and trends of the topological structure of network, dynamic routing will be adjusted automatically for the flow of communications, the quality of its performance is essential to the performance of the whole network, On the basis of ant colony algorithms, the paper carries out a rational research of dynamic routing, and adopts ant colony optimization algorithms to collect the latest information of the network, upgrades the route form and nodal status information dynamically through improving the tactics of choice, solves the load balancing problem of the network, and thus improves the network performance.
出处 《计算机工程与科学》 CSCD 2006年第12期15-18,共4页 Computer Engineering & Science
基金 国家自然科学基金资助项目(60403027) 国家"十五"科技攻关计划项目(2002BA103A04)
关键词 自适应路由 移动AGENT 蚁群算法 ANTNET adaptive routing mobile agent ant colony algorithm AntNet
  • 相关文献

参考文献8

二级参考文献7

  • 1Dorigo M, Maniezzo Vittorio, Colorni Alberto. The Ant System: Optimization by a colony of cooperating agents [J]. IEEE Transactions on Systems, Man, and Cybernetics--Part B,1996, 26(1): 1-13.
  • 2Dorigo M, Gambardella L M. Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem [J]. IEEE Transactions on Evolutionary Computation, 1997, 1(1): 53-66.
  • 3Schoonderwoerd R, Holland O, Bruten J, Rothkrantz L. Ant-based Load Balancing in Telecommunications Networks [J]. Adaptive Behavior, 1997, 5(2): 169-207.
  • 4Daniel Costa,Alain Hertz,Clivier Dubuis. Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs[J] 1995,Journal of Heuristics(1):105~128
  • 5李茂军,童调生.单亲遗传算法及其全局收敛性分析[J].自动化学报,1999,25(1):68-72. 被引量:106
  • 6姜大立,杨西龙,杜文,周贤伟.车辆路径问题的遗传算法研究[J].系统工程理论与实践,1999,19(6):40-45. 被引量:184
  • 7庄昌文,范明钰,李春辉,虞厥邦.基于协同工作方式的一种蚁群布线系统[J].Journal of Semiconductors,1999,20(5):400-406. 被引量:17

共引文献685

同被引文献11

  • 1Tsoumakos D,Roussopoulos N.Adaptive probabilistic search for peer- to-peer networks[C]//Proc of 3rd International Conference on Peer- to-Peer Computing(P2P'03),2003:102-109.
  • 2Kong J S.Resilience of structured P2P systems under ehuru[J].Comput Commun, 2008,31 (10).
  • 3Bisnik N,Abouzeid A A.Optimizing random walk search algorithms in P2P networks[J].Computer Networks,2007,51:1499-1514.
  • 4Koo S G M.A genetic-algorithm-based neighbor-selection strategy for hybrid peer-to-peer networks[C]//IEEE Grid Computing Workshop, 2004.
  • 5Cam G A D.BISON:Biology-inspired techniques for self-organization in dynamic networks[C]//IST-2001-38923,2005.
  • 6Michlmayr E.Ant algorithms for search in unstructured peer-to- peer network[C]//Proceedings of the PhD Workshop,2006.
  • 7The Gnutella[EB/OL].http://www.gnutella.com.
  • 8Wang P, Sparks S, Zou C C. An advanced hybrid peer-to-peer botnet[ C]//Proc of the 1st Workshop on Hot Topics in Understanding Botnets. Berkeley, USA, 2007.
  • 9Rowstron A, Druschel P. Pastry : Scalable, distributed object location and routing for large-scale peer-to-peer systems [ C ]//IFIP/ACM Middleware. Heidelberg, 2001:329-350.
  • 10Zhao B, Kubiatowicz J, Joseph A. Tapestry: An infrastructure for fault-tolerant wide-area location and routing[R]. Technical Report UCB/CSD- 01 -1141, Computer Science Division, 2001:106- 115.

引证文献2

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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