Routing algorithm based on link bandwidth utilization rate

doi:10.3724/SP.J.1087.2012.02422

Journal of Computer Applications ›› 2012, Vol. 32 ›› Issue (09): 2422-2425.DOI: 10.3724/SP.J.1087.2012.02422

• Network and communications • Previous Articles Next Articles

Routing algorithm based on link bandwidth utilization rate

YANG Xiao-qin^1*,ZHANG Li-fang²,CAO Qing-huang³,SUN Hai-yan¹,LI Zhuo-qing¹

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

Received:2012-03-02 Revised:2012-05-12 Online:2012-09-01 Published:2012-09-01

基于链路带宽利用率的路由选择算法

杨晓琴^1*,章丽芳²,曹庆皇³,孙海燕¹,李卓青¹

1.解放军理工大学通信工程学院,南京 210007;
2.浙江广播电视大学临海学院,浙江临海 317000;
3.中国移动通信集团江苏有限公司镇江分公司,江苏镇江 212000

通讯作者: 杨晓琴
作者简介:杨晓琴(1986-),女,安徽安庆人,助教,硕士,主要研究方向:网络性能分析、网络安全; 章丽芳(1973-),女,浙江临海人,讲师,硕士,主要研究方向:网络服务质量、传输控制; 曹庆皇(1986-),男,江苏盐城人,工程师,硕士,主要研究方向:IPv6; 孙海燕(1977-),女,江苏南京人,馆员,硕士,主要研究方向:EPON网络通信; 李卓青(1954-),女,山东海阳人,高级工程师,主要研究方向:分布式网络。

Abstract

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.

Key words: bandwidth utilization, service quality, routing algorithm, load balance, network congestion

摘要： 为避免网络拥塞,针对现有路由调整算法没有考虑网络流量均衡分布和用户使用感知的问题,提出一种路由选择算法。在保证网络时延,不影响用户服务质量的前提下,选择带宽利用率最小的路径,最大限度实现负载均衡。为尽可能反映实际情况,实验采用真实的Abilene2网络拓扑,结果表明:该算法能有效缓解网络拥塞,网络可利用率提高超过50%。与现有算法相比,该算法能同时满足带宽利用率和网络时延两方面要求。此外,通过调整参数值可以满足实际网络中不同业务的要求。

关键词: 带宽利用率, 服务质量, 路由算法, 负载均衡, 网络拥塞

CLC Number:

TP393.2

YANG Xiao-qin ZHANG Li-fang CAO Qing-huang SUN Hai-yan LI Zhuo-qing. Routing algorithm based on link bandwidth utilization rate[J]. Journal of Computer Applications, 2012, 32(09): 2422-2425.

杨晓琴章丽芳曹庆皇孙海燕李卓青. 基于链路带宽利用率的路由选择算法[J]. 计算机应用, 2012, 32(09): 2422-2425.

References

[1]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.

[1]	CAO Xiaowei, QU Zhijian, XU Lingling, LIU Xiaohong. 3D model recognition based on capsule network [J]. Journal of Computer Applications, 2020, 40(5): 1309-1314.
[2]	CHEN Lichao, ZHENG Jiamin, CAO Jianfang, PAN Lihu, ZHANG Rui. Intelligent traffic sign recognition method based on capsule network [J]. Journal of Computer Applications, 2020, 40(4): 1045-1049.
[3]	LI Zhuhong, ZHAO Canming, YAN Long, ZHANG Xinming. Load balancing opportunistic routing protocol for power line communication network in smart grids [J]. Journal of Computer Applications, 2019, 39(3): 812-816.
[4]	FAN Na, ZHU Guangyuan, KANG Jun, TANG Lei, ZHU Yishui, WANG Luyang, DUAN Jiaxin. Routing algorithm based on node cognitive interaction in Internet of vehicles environment [J]. Journal of Computer Applications, 2019, 39(2): 518-522.
[5]	WANG Guan, WANG Ruiyao. Routing algorithm based on cluster-head optimization for self-energized wireless sensor network [J]. Journal of Computer Applications, 2018, 38(6): 1721-1725.
[6]	LONG Dan, LI Xiaohui, DING Yuemin. Multicast routing of power grid based on demand response constraints [J]. Journal of Computer Applications, 2018, 38(4): 1102-1105.
[7]	FAN Zifu, ZHOU Kaiheng, YAO Jie. Game theory based SDN master controller reselection mechanism [J]. Journal of Computer Applications, 2018, 38(3): 776-779.
[8]	XU Lijie. Broadcasting energy-efficiency optimization algorithms for asymmetric duty-cycled sensor network [J]. Journal of Computer Applications, 2018, 38(11): 3275-3281.
[9]	LUO Xiaoxia, SI Fengwei, LUO Xiangyu. Effects of large-scale graph structural feature on partitioning quality [J]. Journal of Computer Applications, 2018, 38(1): 1-5.
[10]	ZHANG Jian, WANG Yang, LIU Dandan. Yac:yet another distributed consensus algorithm [J]. Journal of Computer Applications, 2017, 37(9): 2524-2530.
[11]	LI Zhuhong, ZHAO Canming, ZHOU Fang, ZHANG Xinming. Efficient and load balanced open shortest path first protocol in electric power communication network [J]. Journal of Computer Applications, 2017, 37(7): 1873-1876.
[12]	BIAN Chen, YU Jiong, XIU Weirong, YING Changtian, QIAN Yurong. Partitioning and mapping algorithm for in-memory computing framework based on iterative filling [J]. Journal of Computer Applications, 2017, 37(3): 647-653.
[13]	LIU Yang, PENG Jian, LIU Tang, WANG Bin. Routing algorithm based on layered mechanism in river underwater sensor networks [J]. Journal of Computer Applications, 2016, 36(5): 1183-1187.
[14]	WANG Yefu, ZENG Guosun, DING Chunling. Load-aware optimal placement for heterogeneous controllers in software-defined networking based on unbalanced graph partitioning [J]. Journal of Computer Applications, 2016, 36(4): 883-888.
[15]	XU Xiaoqiong, ZHOU Zhaorong, MA Xiaoxia, YANG Liu. Cooperative behavior based on evolutionary game in delay tolerant networks [J]. Journal of Computer Applications, 2016, 36(2): 483-487.

Routing algorithm based on link bandwidth utilization rate

基于链路带宽利用率的路由选择算法

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 15

Recommended Articles

Metrics