期刊文献+

OpenFIow Based Flow Slice Load Balancing

OpenFIow Based Flow Slice Load Balancing
在线阅读 下载PDF
导出
摘要 Today's data center networks are designed using densely interconnected hosts in the data center.There are multiple paths between source host and destination server.Therefore,how to balance traffic is key issue with the fast growth of network applications.Although lots of load balancing methods have been proposed,the traditional approaches cannot fully satisfy the requirement of load balancing in data center networks.The main reason is the lack of efficient ways to obtain network traffic statistics from each network device.As a solution,the OpenFlow protocol enables monitoring traffic statistics by a centralized controller.However,existing solutions based on OpenFlow present a difficult dilemma between load balancing and packet reordering.To achieve a balance between load balancing and packet reordering,we propose an OpenFlow based flow slice load balancing algorithm.Through introducing the idea of differentiated service,the scheme classifies Internet flows into two categories:the aggressive and the normal,and applies different splitting granularities to the two classes of flows.This scheme improves the performance of load balancing and also reduces the number of reordering packets.Using the trace-driven simulations,we show that the proposed scheme gains over 50%improvement over previous schemes under the path delay estimation errors,and is a practical and efficient algorithm. Today's data center networks are designed using densely interconnected hosts in the data center.There are multiple paths between source host and destination server.Therefore,how to balance traffic is key issue with the fast growth of network applications.Although lots of load balancing methods have been proposed,the traditional approaches cannot fully satisfy the requirement of load balancing in data center networks.The main reason is the lack of efficient ways to obtain network traffic statistics from each network device.As a solution,the OpenFlow protocol enables monitoring traffic statistics by a centralized controller.However,existing solutions based on OpenFlow present a difficult dilemma between load balancing and packet reordering.To achieve a balance between load balancing and packet reordering,we propose an OpenFlow based flow slice load balancing algorithm.Through introducing the idea of differentiated service,the scheme classifies Internet flows into two categories:the aggressive and the normal,and applies different splitting granularities to the two classes of flows.This scheme improves the performance of load balancing and also reduces the number of reordering packets.Using the trace-driven simulations,we show that the proposed scheme gains over 50%improvement over previous schemes under the path delay estimation errors,and is a practical and efficient algorithm.
出处 《China Communications》 SCIE CSCD 2014年第12期72-82,共11页 中国通信(英文版)
基金 supported by a grant from the National Basic Research Development Program of China(973 Program)(No.2012CB315901,2012CB315906) the National High Technology Research and Development Program of China(863 Program)(No.2011AA01A103)
关键词 OpenFlow traffic splitting load balancing packet reordering splitting granularity 负载平衡 负载均衡算法 网络应用 网络流量 数据中心 路径延迟 集中控制器 数据包
  • 相关文献

参考文献1

二级参考文献13

  • 1Umar Javed,Martin Suchara,Jiayue He,Jennifer Rexford.Multipath protocol for delay-sensitive traffic.Communication Systems and Networks and Workshops(COMSNETS 2009).Bangalore:IEEE Press,2009.1-8.
  • 2Minlan Yu,Yung Yi,Jennifer Rexford,Mung Chiang.Rethinking virtual network embedding:Substrate support for path splitting and migration[J].ACM SIGCOMM Computer Communication Review,2008,38(2):17-29.
  • 3Arthur CM,Lehane A,Harle D.Keeping order:Determining the effect of TCP packet reordering.Third International Conference on Networking and Services(ICNS).Athens:IEEE Press,2007.116-116.
  • 4Weiguang Shi,Lukas Kencl.Sequence-preserving adaptive load balancers.Proceedings of the 2006 ACM/IEEE symposium on Architecture for Networking and Communications Systems.New York:ACM Press,2006.143-152.
  • 5Michael Laor,Lior Gendel,et al.The effect of packet reordering in a backbone link on application throughput[J].IEEE Network,2002,16(5):28-36.
  • 6M Shreedhar,George Varghese.Efficient fair queuing using deficit round-robin.IEEE/ACM Transactions on Networking (TON),1996,4(3):375-385.
  • 7Brice Augustin,Xavier Cuvellier,et al.Avoiding traceroute anomalies with Paris traceroute.Internet Measuremet Conference.New York:ACM Press,2006.153-158.
  • 8Srikanth Kandula,Dina Katabi,Shantanu Sinha,Arthur Berger.Dynamic load balancing without packet reordering[J].ACM SIGCOMM Computer Communication Review,2007,37(2):51-62.
  • 9Jiayue He,Jennifer Rexford.Toward internet-wide multipath routing[J].IEEE Network,2008,22(2):16-21.
  • 10Thomas Voice.Stability of multi-path dual congestion control algorithms[J].IEEE/ACM Transactions on Networking (TON),2007,15(6):1231-1239.

共引文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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