计算机科学 ›› 2010, Vol. 37 ›› Issue (12): 60-62.

• 计算机网络与信息安全 • 上一篇    下一篇

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

关礼安,汪斌强   

  1. (国家数字交换系统工程技术研究中心 郑州450002)
  • 出版日期:2018-12-01 发布日期:2018-12-01
  • 基金资助:
    本文受国家863计划项目(2008AA01A323, 2008AA01Z214),国家973计划项目(2007CB307102)资助.

Adjusting Traffic over Multi-paths Based on Feasible Distance of Path

GUAN Li-an,WANG Bin-qiang   

  • Online:2018-12-01 Published:2018-12-01

摘要: 针对现有多路径流量调整算法的负载不均衡问题,提出一种改进的流量调整算法(IAH,Improvcd Adjustment Heuristic)。它将反映网络均衡性的全网信息和局部信息的结合使用,根据路由信息中路径可行距离的变化,遵循距离远的路径能力差和距离近的路径能力强的原则来调整流量,使多路径中流量与相应的可行距离匹配。仿真结果表明,IAH算法比AH算法更晚出现丢包,其丢包率性能整体上要优于AH算法,即IAH算法的负载均衡性优于AH算法。

关键词: 负载均衡,多径,可行距离,流量调整

Abstract: 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 adj usts 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.

Key words: Load balancing,Multi-path,Feasibe distance,Adjusting traffic

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!