Routing algorithm based on link bandwidth utilization rate
YANG Xiao-qin1*,ZHANG Li-fang2,CAO Qing-huang3,SUN Hai-yan1,LI Zhuo-qing1
1.Institute of Communication Engineering,PLA University of Science and Technology,Nanjing Jiangsu 210007,China;
2.Linhai Institute,Zhejiang Radio and Television University,Linhai Zhejiang 317000,China;
3.Zhenjiang Branch,China Mobile Group Jiangsu Company Limited,Zhenjiang Jiangsu 212000,China
Abstract：In order to avoid network congestion, concerning that the current algorithms have not considered the aspects of network flow distribution and user's perception, a routing algorithm which can realize maximum load balance was proposed. The algorithm can decrease the maximal bandwidth utilization rate of network with delay guaranteed. The experiment based on real Abilene2 network topology shows that the proposed algorithm can alleviate the network congestion and improve the network utilization rate over 50% effectively. Compared with the existing algorithms, the proposed algorithm can meet two requirements of the bandwidth utilization and network delay. In addition, by adjusting the parameter values it can meet different business requirements in actual networks.
杨晓琴 章丽芳 曹庆皇 孙海燕 李卓青. 基于链路带宽利用率的路由选择算法[J]. 计算机应用, 2012, 32(09): 2422-2425.
YANG Xiao-qin ZHANG Li-fang CAO Qing-huang SUN Hai-yan LI Zhuo-qing. Routing algorithm based on link bandwidth utilization rate. Journal of Computer Applications, 2012, 32(09): 2422-2425.
NOVAK D C.Managing bandwidth allocations between competing recreational and non-recreational traffic on campus networks [J].Decision Support Systems,2008,45(2):338-353.
[2]
MARINO P P,MANRUBIA B G,PARDO R A.Multi-hour network planning based on domination between sets of traffic matrices[J].Computer Networks,2011,55(3):665-675.
[3]
LAKSHMINARAYANAN K,CAESAR M,RANGAN M,et al.Achieving convergence-free routing using failure-carrying packets[C]// Proceedings of the 2007 Conference on Applications,Technologies,Architectures,and Protocols for Computer Communications.New York:ACM Press,2007:241-252.
[4]
COHEN R,NAKIBLY G.On the computational complexity and effectiveness of N-hub shortest path routing[J].IEEE/ACM Transactions on Networking,2008,16(3):691-704.
[5]
KVALBEIN A,HANSEN A F,CICIC T,et al.Fast IP network recovery using multiple routing configurations[C]// INFOCOM 2006:Proceedings of the 25th IEEE International Conference on Computer Communications.Piscataway,NJ:IEEE Press,2006:1-11.
[6]
ORDA A,SPRINTSON A.Efficient algorithms for computing disjoint QoS paths[C]// Proceedings of the 23rd Annual Joint Conference of the IEEE Computer and Communications Societies.Piscataway,NJ:IEEE Press,2004:738.
[7]
ASSI C,HUO W,SHAMI A.Multiple link failures survivability of optical networks with traffic grooming capability[J].Computer Communications,2006,29(18):3900-3912.
[8]
ZHANG Y.6 months of Abilene traffic matrices[EB/OL].[2011-10-08].http://www.cs.utexas.edu/~yzhang/research/A-bileneTM/.
[9]
QIN TAO,GUAN XIAOHONG,LI WE,et al.Monitoring abnormal network traffic based on blind source separation approach [J].Journal of Network and Computer Applications,2011,34(5):1732-1742.
[10]
SHARAFEDDINE S,DAWY Z.Robust network dimensioning for realtime services over IP networks with traffic deviation [J].Computer Communications,2010,33(8):976-983.
[11]
HE YONG,HE JU,ZHU DAOLI,et al.Traffic network equilibrium with capacity constraints and generalized Wardrop equilibrium [J].Nonlinear Analysis:Real World Applications,2010,11(5):4248-4253.
[12]
LIN Y K.Evaluate the performance of a stochastic-flow network with cost attribute in terms of minimal cuts[J].Reliability Engineering and System Safety,2006,91(5):539-545.
2012, Vol. 32 
