首页 | 本学科首页   官方微博 | 高级检索  
     

基于改进蚁群算法的网络负载均衡路由优化
引用本文:杨春勇,陈少平.基于改进蚁群算法的网络负载均衡路由优化[J].计算机工程,2010,36(8):4-6.
作者姓名:杨春勇  陈少平
作者单位:中南民族大学电子信息工程学院,武汉,430074
基金项目:国家自然科学基金资助项目(60772031);;湖北省自然科学基金资助项目(2008CDB318)
摘    要:最短路径优先的路由控制策略在解决突发业务模式下的拥塞问题上存在不足,针对该问题,采用随机选择尺度因子实现负载均衡,增加路由器向所有相邻路由器转发分组的机会。设计路由算法模拟器,完成改进蚁群网络路由优化算法在4种典型网络上的仿真。以CHINANET为例的对比实验表明,在重负载情况下,改进的蚁群网络路由优化算法能获得较高的吞吐量、较低的平均时延与丢包率。

关 键 词:蚁群优化  网络拥塞  负载均衡
修稿时间: 

Routing Optimization for Network Load Balance Based on Improved Ant Colony Algorithm
YANG Chun-yong,CHEN Shao-ping.Routing Optimization for Network Load Balance Based on Improved Ant Colony Algorithm[J].Computer Engineering,2010,36(8):4-6.
Authors:YANG Chun-yong  CHEN Shao-ping
Affiliation:(College of Electronics Information Engineering, South Central University for Nationalities, Wuhan 430074)
Abstract:The shortest path first algorithm always makes the routers select the shortest path to forward the packets, thus often leads to network congestion. Aiming at this problem, this paper uses a random factor to scale the probability of routing select for the purpose of realizing load balance and increasing the probability of forward the packets to all adjacent routers. It designs a routing algorithm simulator in order to validate the improved ant colony routing algorithm, and four typical network scenes are tested in the simulator. CHINANET is taken as an example, for the heavy load condition, the simulative result presents that the improved algorithm shows higher throughput, lower average latency and packet loss ratio.
Keywords:ant colony optimization  network congestion  load balance
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号