Delay-Guaranteed Key Flow Routing Adjustment Algorithm
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    The unevenly distributed traffic of Internet may lead to congestion and underutilization of network resources. Current methods of routing adjustment for load balancing often get a new path with excessively long length that can exacerbate the quality of service. This paper presents a new flow routing adjustment algorithm named LCBA (length-constrained most balanced algorithm), which can decrease the maximal bandwidth utilization rate of network with delay guaranteed. The experiment based on Abilene2 network topology and traffic data shows that LCBA can mitigate the congestion of backbone network effectively and the maximal bandwidth utilization rate can drease nearly 50% at most. This paper also evaluates the algorithm with an emulation method. Compared with current methods, the new algorithm can satisfy the demand of not only the length of key flow’s path but also the maximal bandwidth utilization rate. Moreover, the theoretical analysis proves that the computational complexity of LCBA is O(N2logN), which is better than that of a majority of methods nowaday.

    Reference
    Related
    Cited by
Get Citation

裴育杰,王洪波,程时端.一种保证时延的关键流路由调整算法.软件学报,2010,21(3):528-538

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:August 16,2008
  • Revised:October 08,2008
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063