Consolidating flows with implicit deadlines for energy-proportional data center networks

To reduce the energy consumption of a large number of network devices in a data center, energy-efficient schemes use various heuristics to consolidate traffic to fewer switches. Most of these works, however, ignore the flow-level performance, which is one of the most critical requirements in production data centers. Hence, flow rate allocation should be considered together with flow path selection to guarantee flow-level performance and in the meantime save energy of network devices. For this reason, we present a framework to ensure that the energy consumption for data center network (DCN) is proportional to the traffic and to guarantee the flow-level performance. Our solution consists of two components: (i) flow rate allocation to meet flows' deadlines and (ii) flow path selection to use fewer switches. We compare our framework with existing techniques under synthetic traffic patterns. Results show that our framework could save, on average, 20% of network energy than the always-on baseline, while maintaining the better flow-level performance, and achieving good running time and fault tolerance simultaneously.

[1]  T. N. Vijaykumar,et al.  Deadline-aware datacenter tcp (D2TCP) , 2012, SIGCOMM '12.

[2]  Ming Zhang,et al.  Understanding data center traffic characteristics , 2010, CCRV.

[3]  Sujata Banerjee,et al.  ElasticTree: Saving Energy in Data Center Networks , 2010, NSDI.

[4]  Lei Shi,et al.  Dcell: a scalable and fault-tolerant network structure for data centers , 2008, SIGCOMM '08.

[5]  Lisa Zhang,et al.  Routing for Power Minimization in the Speed Scaling Model , 2012, IEEE/ACM Transactions on Networking.

[6]  Albert G. Greenberg,et al.  The cost of a cloud: research problems in data center networks , 2008, CCRV.

[7]  Lei Huang,et al.  PCube: Improving Power Efficiency in Data Center Networks , 2011, 2011 IEEE 4th International Conference on Cloud Computing.

[8]  Lisa Zhang,et al.  Routing and Scheduling for Energy and Delay Minimization in the Powerdown Model , 2010, 2010 Proceedings IEEE INFOCOM.

[9]  Sujata Banerjee,et al.  A Power Benchmarking Framework for Network Devices , 2009, Networking.

[10]  Ali Munir,et al.  Minimizing flow completion times in data centers , 2013, 2013 Proceedings IEEE INFOCOM.

[11]  Xiaodong Wang,et al.  CARPO: Correlation-aware power optimization in data center networks , 2012, 2012 Proceedings IEEE INFOCOM.

[12]  Athanasios V. Vasilakos,et al.  Energy-Efficient Flow Scheduling and Routing with Hard Deadlines in Data Center Networks , 2014, 2014 IEEE 34th International Conference on Distributed Computing Systems.

[13]  Haitao Wu,et al.  BCube: a high performance, server-centric network architecture for modular data centers , 2009, SIGCOMM '09.

[14]  Alon Itai,et al.  On the complexity of time table and multi-commodity flow problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[15]  Athanasios V. Vasilakos,et al.  GreenDCN: A General Framework for Achieving Energy Efficiency in Data Center Networks , 2013, IEEE Journal on Selected Areas in Communications.

[16]  Albert G. Greenberg,et al.  VL2: a scalable and flexible data center network , 2009, SIGCOMM '09.

[17]  Amin Vahdat,et al.  A scalable, commodity data center network architecture , 2008, SIGCOMM '08.

[18]  Amin Vahdat,et al.  Hedera: Dynamic Flow Scheduling for Data Center Networks , 2010, NSDI.

[19]  Luiz André Barroso,et al.  Web Search for a Planet: The Google Cluster Architecture , 2003, IEEE Micro.

[20]  Antony I. T. Rowstron,et al.  Better never than late: meeting deadlines in datacenter networks , 2011, SIGCOMM.

[21]  Brighten Godfrey,et al.  Finishing flows quickly with preemptive scheduling , 2012, CCRV.