期刊文献+

基于路径可行距离的流量调整算法

Adjusting Traffic over Multi-paths Based on Feasible Distance of Path
下载PDF
导出
摘要 针对现有多路径流量调整算法的负载不均衡问题,提出一种改进的流量调整算法(IAH,Improved Adjust-ment Heuristic)。它将反映网络均衡性的全网信息和局部信息的结合使用,根据路由信息中路径可行距离的变化,遵循距离远的路径能力差和距离近的路径能力强的原则来调整流量,使多路径中流量与相应的可行距离匹配。仿真结果表明,IAH算法比AH算法更晚出现丢包,其丢包率性能整体上要优于AH算法,即IAH算法的负载均衡性优于AH算法。 For eliminating the problem of poor load balancing which is resulted from implementing current adjusting traffic algorithms over multi-paths,IAH(Improved Adjustment Heuristic) was proposed.IAH utilizes the information of whole network and nodes which show the state of loads on the links.Based on the change of feasible distance of paths in routing information and the principle that the capability of short path is better than one long path,IAH adjusts traffic over multi-paths,transfers traffic from links with heavy load to light ones and make their traffic respectively match with their feasible distance.Simulation results show that the time of losing packets in implementing IAH is later than AH and the losing packet rate of IAH is better than AH in most time.Namely,the load balancing performance of IAH exceeds one of AH.
出处 《计算机科学》 CSCD 北大核心 2010年第12期60-62,共3页 Computer Science
基金 国家863计划项目(2008AA01A323 2008AA01Z214) 国家973计划项目(2007CB307102)资助
关键词 负载均衡 多径 可行距离 流量调整 Load balancing Multi-path Feasible distance Adjusting traffic
  • 相关文献

参考文献6

  • 1Cao Z,Wang Z,Zegura E.Performance of hashing-based sch-emes for internet load balancing[].Proceedings of IEEE IN-FOCOM.2000 被引量:1
  • 2Chim T W,Yeung K L.Traffic distribution over Equal-cost-multi-paths[].Proceedings of IEEE International Conferenceon Communications.2004 被引量:1
  • 3Srinivas V.Multipath Routing Mechanisms for Traffic Engi-neering and Quality of Service in the Internet[]..2001 被引量:1
  • 4Gallager,R.G.A minimum delay routing algorithm using distributed computation[].IEEE Transactions on Communications.1977 被引量:1
  • 5Shi H,HSethu.Greedy fair queueing:Agoal-oriented strategyfor fair real-time packet scheduling[].Proceedings of Real-Time Systems Symposium.2003 被引量:1
  • 6HAHNE E L.Round-robin schedulingfor max-minfairnessin data networks[].IEEEJournal on Selected Areasin Commu-nications.1991 被引量:1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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