期刊文献+

基于OpenFlow的负载均衡机制 被引量:2

Load balancing mechanism based on OpenFlow
下载PDF
导出
摘要 针对OpenFlow网络流量分配不均导致网络拥塞的问题,提出适用于OpenFlow网络多链路负载均衡机制。在控制器端实现多路径路由的K最短路径算法,在交换机网络中部署运行用于实时监控,收集所有网络节点和链路信息程序,将收集的信息提交给控制器,计算所有流的最优路径并下发至各OpenFlow交换机。链路资源可根据当前的业务需求和链路情况,通过流均衡算法灵活调整网络中的流量负载来适应网络流量的变化。实验结果表明,该策略能有效缓解网络拥塞,提高网络带宽利用率,降低传输时延,有效提高网络传输的整体性能。 In view of the network congestionproblem caused by the uneven distribution of OpenFlow network traffic, the load balancing mechanism "applicable to the OpenFlow network link was put forwardto realize the K shortest path algorithm of multi- path routing in the controller , to deploy and operate the program for real-time monitoring and collecting all the network nodes and link information in the switch network, and to submit the collected information to the controller and compute the optimal path of all the flows and issue it to all OpenFlow switches, which enabled the link resources, according to the current needs of the business and link, to flexibly adjust the network traffic load using flow equalization algorithm to adapt to the change of net work traffic. Experimental results show that the strategy can effectively alleviate the congestion of network, improve the net- work bandwidth utilization and reduce the transmission delay. Iteffectively enhances the overall performance of network transmission.
出处 《计算机工程与设计》 北大核心 2015年第9期2356-2360,2394,共6页 Computer Engineering and Design
关键词 OpenFlow技术 K最短路径 网络测量 带宽利用率 负载均衡 OpenFlow technology K shortest path network measurement bandwidth utilization load balancing
  • 相关文献

参考文献4

二级参考文献93

  • 1张焕国,罗捷,金刚,朱智强,余发江,严飞.可信计算研究进展[J].武汉大学学报(理学版),2006,52(5):513-518. 被引量:113
  • 2NOVAK D C. Managing bandwidth allocations between competing recreational and non-recreational traffic on campus networks [ J]. Decision Support Systems, 2008, 45(2) :338 -353.
  • 3MARINO 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.
  • 4LAKSHMINARAYANAN 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.
  • 5COHEN 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.
  • 6KVALBEIN 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.
  • 7ORDA 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.
  • 8ASSI 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.
  • 9ZHANG Y. 6 months of Abilene traffic matrices[ EB/OL]. [ 2011- 10-08]. http://www. cs. utexas.edu/- yzhang/research/A-bile- neTM/.
  • 10QIN 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.

共引文献440

同被引文献8

引证文献2

二级引证文献14

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部