期刊文献+

基于链路带宽利用率的路由选择算法 被引量:10

Routing algorithm based on link bandwidth utilization rate
下载PDF
导出
摘要 为避免网络拥塞,针对现有路由调整算法没有考虑网络流量均衡分布和用户使用感知的问题,提出一种路由选择算法。在保证网络时延,不影响用户服务质量的前提下,选择带宽利用率最小的路径,最大限度实现负载均衡。为尽可能反映实际情况,实验采用真实的Abilene2网络拓扑,结果表明:该算法能有效缓解网络拥塞,网络可利用率提高超过50%。与现有算法相比,该算法能同时满足带宽利用率和网络时延两方面要求。此外,通过调整参数值可以满足实际网络中不同业务的要求。 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.
出处 《计算机应用》 CSCD 北大核心 2012年第9期2422-2425,共4页 journal of Computer Applications
关键词 带宽利用率 服务质量 路由算法 负载均衡 网络拥塞 bandwidth utilization service quality routing algorithm load balance network congestion
  • 引文网络
  • 相关文献

参考文献12

  • 1NOVAK D C. Managing bandwidth allocations between competing recreational and non-recreational traffic on campus networks [ J]. Decision Support Systems, 2008, 45(2) :338 -353.
  • 2MARINO 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.
  • 3LAKSHMINARAYANAN K, CAESAR M, RANGAN M, et al. A- chieving convergence-free routing using failure-carrying packets [C]// Proceedings of the 2007 Conference on Applications, Tech- nologies, Architectures, and Protocols for Computer Communica- tions. New York: ACM Press, 2007:241 -252.
  • 4COHEN R, NAKIBLY G. On the computational complexity and ef- fectiveness of N-hub shortest path routing[ J]. IEEE/ACM Transac- tions on Networking, 2008, 16( 3):691 -704.
  • 5KVALBEIN A, HANSEN A F, CICIC T, et al. Fast IP network re- covery using multiple routing configurations[ C]//INFOCOM 2006: Proceedings of the 25th IEEE International Conference on Computer Communications. Piscataway, NJ: IEEE Press, 2006:1-11.
  • 6ORDA A, SPRINTSON A. Efi%ient algorithms for computing dis- joint QoS paths[ C]//Proceedings of the 23rd Annum Joint Confer- ence of the IEEE Computer and Communications Societies. Piscat- away, NJ: IEEE Press, 2004: 738.
  • 7ASSI C, HUO W, SHAMI A. Multiple link failures survivability of optical networks with traffic grooming capability[ J]. Computer Com- munications, 2006, 29(18) : 3900 - 3912.
  • 8ZHANG Y. 6 months of Abilene traffic matrices[ EB/OL]. [ 2011- 10-08]. http://www. cs. utexas.edu/- yzhang/research/A-bile- neTM/.
  • 9QIN TAO, GUAN XIAOHONG, LI WE, et al. Monitoring abnormal network traffic based on blind source separation approach [ J]. Jour- nal of Network and Computer Applications, 2011, 34 (5) : 1732 - 1742.
  • 10SHARAFEDDINE S, DAWY Z. Robust network dimensioning for realtime services over IP networks with traffic deviation [ J]. Com- puter Communications, 2010,33(8) :976 -983.

同被引文献51

引证文献10

二级引证文献48

;
使用帮助 返回顶部