Sorry, I don't understand your search. ×
Back to Search Start Over

AggreFlow: Achieving Power Efficiency, Load Balancing, and Quality of Service in Data Center Networks

Authors :
Zhi-Li Zhang
Sen Liu
Yuanqing Xia
Ya-Feng Liu
Zehua Guo
Yang Xu
H. Jonathan Chao
Source :
IEEE/ACM Transactions on Networking. :1-17
Publication Year :
2020
Publisher :
Institute of Electrical and Electronics Engineers (IEEE), 2020.

Abstract

Power-efficient Data Center Networks (DCNs) have been proposed to save power of DCNs using OpenFlow. In these DCNs, the OpenFlow controller adaptively turns on/off links and OpenFlow switches to form a minimum-power subnet that satisfies the traffic demand. As the subnet changes, flows are dynamically routed and rerouted to the routes composed of active switches and links. However, existing flow scheduling schemes could cause undesired results: (1) power inefficiency: due to unbalanced traffic allocation on active routes, extra switches and links may be activated to cater to bursty traffic surges on congested routes, and (2) Quality of Service (QoS) fluctuation: because of the limited flow entry processing ability, switches may not be able to timely install/delete/update flow entries to properly route/reroute flows. In this paper, we propose AggreFlow, a dynamic flow scheduling scheme that achieves power efficiency and QoS improvement using three techniques: Flow-set Routing , Lazy Rerouting , and Adaptive Rerouting . Flow-set Routing achieves load balancing with a small number of flow entry operations by routing flows in a coarse-grained flow-set fashion. Lazy Rerouting spreads rerouting operations over a relatively long period of time, reducing the burstiness of entry operation on switches. Adaptive Rerouting selectively reroutes flow-sets to maintain load balancing. We built an NS3 based fat-tree network simulation platform to evaluate AggreFlow’s performance. The simulation results show that AggreFlow reduces power consumption by about 18%, yet achieving load balancing and improved QoS (low packet loss rate and reducing the number of processing entries for flow scheduling by 98%), compared with baseline schemes.

Details

ISSN :
15582566 and 10636692
Database :
OpenAIRE
Journal :
IEEE/ACM Transactions on Networking
Accession number :
edsair.doi...........808c019671474b1b1e978eb46f6c6508