期刊文献+

Nimble:一种适用于OpenFlow网络的快速流调度策略 被引量:17

Nimble:A Fast Flow Scheduling Strategy for OpenFlow Networks
在线阅读 下载PDF
导出
摘要 突发流量是导致网络拥塞和丢包的重要原因之一.减少网络拥塞的一种方法是在多条可达路径间均衡网络流量,如等价多路径(Equal-Cost Multi-Path,ECMP)路由.然而,大多数等价多路径路由或者静态地将不同的流/数据包哈希到不同的路径,或者依赖于局部的/过时的路径状态信息.OpenFlow技术利用集中式控制器控制网络行为,为控制器根据全局网络状态信息进行动态的数据流优化提供了可能.然而,采用基于轮询的网络状态探测机制在处理突发流量问题上面临诸多困难.文中提出一种用于OpenFlow网络的快速流调度策略,称为Nimble.Nimble架构扩展了OpenFlow协议的packet-in消息,由网络设备自主监测设备状态,并在网络出现拥塞时通过扩展的packet-in消息主动向控制器通告拥塞信息.模拟结果显示Nimble策略能够以近于零的时延检测网络链路拥塞,从而有效提高网络性能. Bursty traffic is one of the most important reasons that cause network congestion and packet loss. One way to red/ace network congestion is to load balance traffic among multiple paths, such as ECMP (Equal-Cost Multi-Path) routing. However, most of ECMP routing algo- rithms either statically hash different flows/packets to separate paths, or depend on local/stale path load information. OpenFlow provides a new possibility to dynamically schedule flows according to global network status using centralized controllers. However, the poll-based mechanism to sense network status makes it hard to handle bursty traffic. In this paper, we propose a fast flow scheduling strategy for OpenFlow networks, namely the Nimble. The Nimble detects congestion by switches themselves, and exploits the extended packet-in message to notify the controllers as soon as congestion occurs. Simulation results show that the Nimble strategy could detect link congestion at nearly zero delay and could significantly improve network performance.
出处 《计算机学报》 EI CSCD 北大核心 2015年第5期1056-1068,共13页 Chinese Journal of Computers
基金 国家自然科学基金(61221062 61331008 61202056) 中国科学院战略性先导科技专项(XDA06010401)资助~~
关键词 数据中心网络 OpenFlow 流调度 负载均衡 data center network OpenFlow flow scheduling load balancing
  • 相关文献

参考文献24

  • 1A1-Fares M, Loukissas A, Vahdat A. A scalable, commodity data center network architecture//Proceedings of the ACM SIGCOMM 2008 Conference on Data Communication. Seattle, USA, 2008:63-74.
  • 2Kim J, Dally W J, Scott S, Abts D. Technology-driven, highly-scalable dragonfly topology//Proceedings of the 35th Annual International Symposium on Computer Architecture.Beijing, China, 2008.. 77-88.
  • 3Guo Chuanxiong, Lu Guohan, Li Dan, et al. BCube: A high performance, server-centric network architecture for modular data eenters//Proceedings of the ACM SIGCOMM 2009 Conference on Data Communication. Barcelona, Spain, 2009 : 63-74.
  • 4Singla A, Hong C-Y, Popa L, Godfrey P B. Jellyfish: Networking data centers randomly//Proceedings of the 9th USENIX Conference on Networked Systems Design and Implementation. San Jose, USA, 2012:225-238.
  • 5Greenberg A, Hamilton J R, Jain N, et al. VL2: A scalable and flexible data center network//Proceedings of the ACM SIGCOMM 2009 Conference on Data Communication. Barcelona, Spain, 2009:51-62.
  • 6Guo Chuanxiong, Wu Haitao, Tan Kun, et al. DCelh A scalable and fault-tolerant network structure for data centers// Proceedings of the ACM SIGCOMM 2008 Conference on Data Communication. Seattle, USA, 2008:75-86.
  • 7Fu Binzhang, Han Yinhe, Ma Jun, et al. An abacus turn model for time/space-efficient reconfigurable routing// Proceedings of the 38th Annual International Symposium on Computer Architecture. San Jose, USA, 2011:259-270.
  • 8A1-Fares M, Radhakrishnan S, Raghavan B, et al. Hedera Dynamic flow scheduling for data center networks// Proceedings of the 7th USENIX Conference on Networked Systems Design and Implementation. San Jose, USA, 2010: 281-296.
  • 9McKeown N, Anderson T, Balakrishnan H, et al. Open- Flow: Enabling innovation in campus networks. SIGCOMM Computer Communication Review, 2008, 38(2): 69-74.
  • 10Benson T, Akella A, Maltz D A. Network traffic characteristics of data centers in the wild//Proceedings of the 10th ACM SIGCOMM Conference on Internet Measurement. Melboume, Australia, 2010:267-280.

同被引文献84

  • 1李娟.海上通信网络自主防御数据迭代加密方法[J].舰船科学技术,2019,41(24):112-114. 被引量:3
  • 2Open Networking Foundation.Open Flow[EB/OL].(2016)[2016].https://www.opennetworking.org/en/sdn-resources/openflow.
  • 3MCKEOWN N,ANDERSON T,BALAKRISHNAN H,et al.Open Flow:Enabling innovation in campus networks[J].SIGCOMM Computer Communication Review,2008,38(2):69-74.
  • 4GREENBERG A,HAMILTON J R,JAIN N,et al.VL2:A scalable and flexible data center network[C].Proceedings of the AC_MSIGCOMM 2009 Conference on Data Communication.Barcelona,Spain,2009:51-62.
  • 5GREENBERG A,HAMILTON J,MALTZ D A,et al.The cost of a cloud:research problems in data center networks[C].In ACM SIGCOMM,2008:68-73.
  • 6Long Hui.Research on the Open Flow-based load-balancing routing in distributed networks[D].Shanghai:Shanghai Jiao Tong University,2013.
  • 7CURTIS A R,KIM W.Mahout:low-overhead datacenter traffic management using end-host-based elephant detection[J].IEEE INFOCOM,2011,2(3):1629-1637.
  • 8BACKHOUSE R C,EIJINDE J P H W,GASTEREN A.J.M.V.Calculating path algorithms[J].Science of Computer Programming,1994,22(1-2):3-19.
  • 9Li Jun,Chang Xiangqing,Ren Yongmao,et al.An effective path load balancing mecha nism based on SDN[C].IEEE 13th International Conference on Trust,Security and Privacy in Computing and Communications,2014.
  • 10Mininet Team.Mininet:An instant virtual network on your laptop[EB/OL].(2016)[2016].http://www.mininet.org/.

引证文献17

二级引证文献128

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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