Network Element Scheduling for Achieving Energy-Aware Data Center Networks
Keywords:data center networks, green computing, energy aware, Steiner tree
The goal of data center network is to interconnect a massive number of servers so as to provide reliable and scalable computing and storage infrastructure for cloud-based Internet services and data-intensive scientific applications. Recent studies reveal that the network elements consume 10âˆ¼20% of the overall power in a data center, which has introduced a challenge to reducing network energy cost without adversely affecting network performance. Considering unique features of traffic patterns and network topologies in data centers, this paper proposes a novel Network Element Scheduling Scheme (NESS) to reduce data center energy consumption from the networking perspective. The core idea is to turn on only a minimal subset of network elements to satisfy routing requirements, and put to sleep or shut down the rest unneeded ones for energy saving. In NESS, the logical network architecture formed by the active elements not only achieves the basic purpose for server interconnections in data centers, but also can support multi-path routing between pairs of hot servers for load balancing. Simulation experiments are performed in representative data center network topologies, and the results demonstrate the effectiveness of NESS in energy conserving on network elements in data centers.
U.S. Enviromental Protection Agency (EPA), Report to Congress on Server and Data Center Energy Efficiency: Public Law 109-431, EPA ENERGY STAR Program, August, 2007
A.G. Greenberg, P. Lahiri, D.A. Maltz, P. Patel and S. Sengupta, The Cost of a Cloud: Research Problems in Data Center Networks, ACM SIGCOMM Computer Communication Review, 39(1):68-73, 2009 http://dx.doi.org/10.1145/1496091.1496103
B. Heller, S. Seetharaman, P. Mahadevan, Y. Yiakoumis, P. Sharma, S. Banerjee and N. Mckeown, ElasticTree: Saving Energy in Data Center Networks, Proceedings of the 7th USENIX Symposium on Networked Systems Design and Implementation (NSDI), 249-264, 2010
D. Halperin, S. Kandula, J. Padhye, P. Bahl and D. Wetherall, Augmenting Data Center Networks with Multi-Gigabit Wireless Links, Proceedings of the 2011 ACM SIGCOMM conference, 38-49, 2011
A.P. Bianzino, C. Chaudet, F. Larroca, D. Rossi and J.L. Rougier, Energy-Aware Routing: a Reality Check. Proceedings of the 2010 IEEE GLOBECOM workshops, 1422-1427, 2010 http://dx.doi.org/10.1109/GLOCOMW.2010.5700172
C.X. Guo, H.T Wu, K. Tan, L. Shi, Y.G. Zhang and S.W. Lu, DCell: A Scalable and Fault- Tolerant Network Structure for Data Centers. Proceedings of the 2008 ACM SIGCOMM conference, 75-86, 2008 http://dx.doi.org/10.1145/1402958.1402968
A. Greenberg, J.R. Hamilton and N. Jain, VL2: A Scalable and Flexible Data Center Network. Proceedings of the 2009 ACM SIGCOMM conference, 51-62, 2009 http://dx.doi.org/10.1145/1592568.1592576
M. Al-Fares, A. Loukissas and A. Vahdat, A Scalable, Commodity Data Center Network Architecture. Proceedings of the 2008 ACM SIGCOMM conference, 63-74, 2008 http://dx.doi.org/10.1145/1402958.1402967
R.N. Mysore, A. Pamboris, N. Farrington, N. Huang, P. Miri, S. Radhakrishnan, V. Subramanya and A. Vahdat, PortLand: A Scalable Fault-Tolerant Layer 2 Data Center Network Fabric. Proceedings of the 2009 ACM SIGCOMM conference, 39-50, 2009 http://dx.doi.org/10.1145/1592568.1592575
C.X. Guo, G.H. Lu, D. Li, H.T. Wu, X. Zhang, Y.F. Shi, C. Tian, Y.G. Zhang and S.W. Lu, BCube: A High Performance, Server-Centric Network Architecture for Modular Data Centers. Proceedings of the 2009 ACM SIGCOMM conference, 63-74, 2009 http://dx.doi.org/10.1145/1592568.1592577
D. Li, C.X. Guo, H.T. Wu, Y.G. Zhang and S.W. Lu, Ficoon: Using Backup Port for Server Interconnection in Data Centers. Proceedings of the 28th IEEE International Conference on Computer Communications (INFOCOM), 2276-2285, 2009
C. Hopps, Analysis of an Equal-Cost Multi-Path Algorithm. IETF RFC 2992, November 2000
K. Xi, Y.L. Liu and H.J. Chao, Enabling Flow-based Routing Control in Data Center Networks using Probe and ECMP. Proceedings of the 30th IEEE International Conference on Computer Communications (INFOCOM) Workshops, 614-619, 2011
J. Zhang, F.Y. Ren and C. Lin, Modelling and Understanding TCP Incast in Data Center Networks. Proceedings of the 30th IEEE International Conference on Computer Communications (INFOCOM), 1377-1385, 2011
X.Q. Meng, V. Pappas and L. Zhang, Improving the Scalability of Data Center Networks with Traffic-aware Virtual Machine Placement. Proceedings of the 29th IEEE International Conference on Computer Communications (INFOCOM), 1154-1162, 2010
D.A. Joseph, A. Tavakoli and I. Stoica, A Policy-aware Switching Layer for Data Centers. ACM SIGCOMM Computer Communication Review, 38(4): 51-62, 2008 http://dx.doi.org/10.1145/1402946.1402966
N. Farrington, G. Porter, S. Radhakrishnan, H.H. Bazzaz, V. Subramanya, Y. Fainman, G. Papen and A. Vahdat. Helios: A Hybrid Electrical/Optical Switch Architecture for Modular Data Centers. Proceedings of the 2010 ACM SIGCOMM conference, 339-350, 2010 http://dx.doi.org/10.1145/1851182.1851223
M. Gupta and S. Singh, Greening of the Internet. Proceedings of the 2003 ACM SIGCOMM conference, 19-26, 2003
M. Gupta and S. Singh, Using Low-Power Modes for Energy Conservation in Ethernet LANs. Proceedings of the 26th IEEE International Conference on Computer Communications (INFOCOM), 2451-2455, 2007
C. Gunaratne, K. Christensen, B. Nordman and S. Suen, Reducing the Energy Consumption of Ethernet with Adaptive Link Rate (ALR). IEEE Transactions on Computers, 57(4): 448- 461, 2008 http://dx.doi.org/10.1109/TC.2007.70836
R. Hays, Active/Idle Toggling with Low-Power Idle. Presentation for IEEE 802.3az Task Force, 2008
Y.F. Shang, D. Li and M.W. Xu, Energy-Aware Routing in Data Center Network. Proceedings of the 1st ACM SIGCOMM Workshop on Green Networking 2010, 1-8, 2010
V. Mann, A. Kumar, P. Dutta and S. Kalyanaraman, VMFlow: Leveraging VM Mobility to Reduce Network Power Costs in Data Centers. Lecture Notes in Computer Science Volume 6640 (IFIP Networking 2011), 198-211, 2011
M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NPCompleteness. W. H. Freeman Publishers Company, 1979
H. Takahashi, A. Matsuyama, An Approximate Solution for the Steiner Problem in Graphs. Mathematica Japonicae, 24: 571-577, 1980
N. Gude, T. Koponen, J. Pettit, B. Pfaff, M. Casado, N. Mckeown, S. Sehnker. NOX: Towards an Operating System for Networks. ACM SIGCOMM Computer Communication Review, 38(3): 105-110, 2008 http://dx.doi.org/10.1145/1384609.1384625
N. McKeown, T. Anderson, H. Balakrishnan, G. Parulkar, L. Perterson, J. Rexford, S. Shenker, J. Turner, OpenFlow: Enabling Innovation in Campus Networks. ACM SIGCOMM Computer Communication Review, 38(2): 69-74, 2008 http://dx.doi.org/10.1145/1355734.1355746
T. Benson, A. Anand, A. Akella, M. Zhang, Understanding Data Center Traffic Characteristics. ACM SIGCOMM Computer Communication Review, 40(1), 92-99, 2010. http://dx.doi.org/10.1145/1672308.1672325
The Boost Graph Library, http://www.boost.org/doc/libs/release/libs/graph.
D. Abts, M.R. Marty, P.M. Welles, P. Klausler, H Liu, Energy Proportional Datacenter Networks. Proceedings of the 37th ACM/IEEE International Symposium on Computer Architecture (ISCA), 338-347, 2010
K. Chen, C.C. Hu, X. Zhang, K. Zheng, Y. Chen, A.V. Vasilakos, Survey on Routing in Data Centers: Insights and Future Directions. IEEE Network, 25(4), 6-10, 2011 http://dx.doi.org/10.1109/MNET.2011.5958002
ONLINE OPEN ACCES: Acces to full text of each article and each issue are allowed for free in respect of Attribution-NonCommercial 4.0 International (CC BY-NC 4.0.
You are free to:
-Share: copy and redistribute the material in any medium or format;
-Adapt: remix, transform, and build upon the material.
The licensor cannot revoke these freedoms as long as you follow the license terms.
DISCLAIMER: The author(s) of each article appearing in International Journal of Computers Communications & Control is/are solely responsible for the content thereof; the publication of an article shall not constitute or be deemed to constitute any representation by the Editors or Agora University Press that the data presented therein are original, correct or sufficient to support the conclusions reached or that the experiment design or methodology is adequate.