Performance-Aware Energy Saving for Data Center Networks

Today's data center networks (DCNs) tend to have tens to hundreds of thousands of servers that provide massive and sophisticated services. The architectural design of DCNs are usually over-provisioned for peak workloads and fault tolerance. Statistically, DCNs remain highly under-utilized, with...

Full description

Saved in:
Bibliographic Details
Published inIEEE eTransactions on network and service management Vol. 16; no. 1; pp. 206 - 219
Main Authors Al-Tarazi, Motassem, Chang, J. Morris
Format Journal Article
LanguageEnglish
Published New York IEEE 01.03.2019
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text

Cover

Loading…
Abstract Today's data center networks (DCNs) tend to have tens to hundreds of thousands of servers that provide massive and sophisticated services. The architectural design of DCNs are usually over-provisioned for peak workloads and fault tolerance. Statistically, DCNs remain highly under-utilized, with typical utilization of around 30%. Network over-provisioning and under-utilization can be exploited for energy-saving. Most research efforts on DCN energy saving focus on how to save maximum energy but have little or no consideration to the performance of the residual network. Thus, the DCN performance can become degraded and the network left vulnerable to sudden traffic surges. In this paper, we have studied the energy-saving problem in DCNs while preserving network performance. The problem was formulated as mixed integer linear problem (MILP) solvable by CPLEX in order to minimize the energy consumed by DCN; meanwhile, safety threshold constraints for links utilization are met. To overcome CPLEX high computational time, a heuristic algorithm to provide practical and efficient solution for the MILP is introduced. The heuristic algorithm uses switches grouping and links consolidation to switch the traffic to a small number of network devices and turn off unused switches and links. Valiant load balancing is used to distribute the loads over active links. Simulation experiments using synthetic and real packet traces were conducted to validate the heuristic in terms of energy consumption and network performance. The results show that the heuristic can save up to 45% of the network energy and improve the average imbalance scores for links and switches by more than 50% with minimal effect on network performance.
AbstractList Today's data center networks (DCNs) tend to have tens to hundreds of thousands of servers that provide massive and sophisticated services. The architectural design of DCNs are usually over-provisioned for peak workloads and fault tolerance. Statistically, DCNs remain highly under-utilized, with typical utilization of around 30%. Network over-provisioning and under-utilization can be exploited for energy-saving. Most research efforts on DCN energy saving focus on how to save maximum energy but have little or no consideration to the performance of the residual network. Thus, the DCN performance can become degraded and the network left vulnerable to sudden traffic surges. In this paper, we have studied the energy-saving problem in DCNs while preserving network performance. The problem was formulated as mixed integer linear problem (MILP) solvable by CPLEX in order to minimize the energy consumed by DCN; meanwhile, safety threshold constraints for links utilization are met. To overcome CPLEX high computational time, a heuristic algorithm to provide practical and efficient solution for the MILP is introduced. The heuristic algorithm uses switches grouping and links consolidation to switch the traffic to a small number of network devices and turn off unused switches and links. Valiant load balancing is used to distribute the loads over active links. Simulation experiments using synthetic and real packet traces were conducted to validate the heuristic in terms of energy consumption and network performance. The results show that the heuristic can save up to 45% of the network energy and improve the average imbalance scores for links and switches by more than 50% with minimal effect on network performance.
Author Al-Tarazi, Motassem
Chang, J. Morris
Author_xml – sequence: 1
  givenname: Motassem
  orcidid: 0000-0002-2825-5430
  surname: Al-Tarazi
  fullname: Al-Tarazi, Motassem
  email: altarazi@iastate.edu
  organization: Department of Computer Science, Iowa State University, Ames, IA, USA
– sequence: 2
  givenname: J. Morris
  surname: Chang
  fullname: Chang, J. Morris
  email: chang5@usf.edu
  organization: Department of Electrical Engineering, University of South Florida, Tampa, FL, USA
BookMark eNp9kE1PwkAQhjcGEwH9AcZLE8-t-0G3u0eC-JEgmoDnzXQ7JUXY4naR8O8tgRjjwdNMMu8zk3l6pONqh4RcM5owRvXdfDp7SThlOuFKM8XlGekyLXg8SEXW-dVfkF7TLClNFdO8S9Qb-rL2a3AW4-EOPEZjh36xj2bwVblF1A6jewgQjdAF9NEUw672H80lOS9h1eDVqfbJ-8N4PnqKJ6-Pz6PhJLZcixAXaAsBSCEtuC3TvMgKq3PMKde8VFkmVCq4YhKUlFKIHKSQbRS1AJCDDESf3B73bnz9ucUmmGW99a49aTjTjKU0a9_qE3ZMWV83jcfSbHy1Br83jJqDIHMQZA6CzElQy2R_GFsFCFXtgodq9S95cyQrRPy5pCSVjA7EN-ZpdD8
CODEN ITNSC4
CitedBy_id crossref_primary_10_1016_j_jpdc_2022_09_009
crossref_primary_10_14232_actacyb_299115
crossref_primary_10_1002_nem_2188
crossref_primary_10_1109_TNSM_2022_3192133
crossref_primary_10_1109_TSUSC_2020_2999717
crossref_primary_10_1016_j_suscom_2024_100973
crossref_primary_10_1109_ACCESS_2023_3272499
crossref_primary_10_1109_TNSM_2021_3126822
crossref_primary_10_3390_sym11050646
crossref_primary_10_1109_TNSM_2020_2975580
crossref_primary_10_1177_1550147720935775
Cites_doi 10.1109/GLOCOM.2012.6503497
10.1109/JSAC.2014.140102
10.1109/ICNP.2010.5762751
10.1109/2.841785
10.1109/TCC.2015.2511720
10.1109/ICDCS.2017.138
10.1109/GreenCom-iThings-CPSCom.2013.28
10.1109/TNSM.2015.2436408
10.1109/GLOCOM.2014.7037143
10.1145/2975159
10.1145/2079296.2079314
10.1145/2208828.2208831
10.1109/TNSM.2015.2443838
10.1145/1868447.1868455
10.1145/1851275.1851191
10.1016/j.comnet.2013.12.006
10.1109/INFCOM.2012.6195471
10.1145/1851290.1851292
10.1109/TCC.2015.2424892
10.1145/1879141.1879175
10.1109/ICDCSW.2009.44
10.1145/2567529.2567560
10.1145/1816038.1816004
10.1109/TPDS.2014.2350990
10.1109/ICDCS.2014.33
10.1145/2038916.2038918
10.1016/j.future.2013.07.006
10.1109/NCA.2013.24
10.1109/TCC.2015.2511732
10.1145/1592681.1592693
10.1109/IPDPS.2013.100
10.23919/IFIPNetworking.2017.8264860
10.1002/cpe.2963
10.1145/1402946.1402967
10.1007/s11227-010-0504-1
10.1007/s10586-014-0404-x
10.1109/TNSM.2017.2711567
10.1145/2377677.2377719
10.1016/j.comcom.2013.11.005
10.1109/IPDPS.2015.22
10.1109/CLOUD.2011.74
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2019
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2019
DBID 97E
RIA
RIE
AAYXX
CITATION
DOI 10.1109/TNSM.2019.2891826
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005–Present
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE/IET Electronic Library
CrossRef
DatabaseTitle CrossRef
DatabaseTitleList

Database_xml – sequence: 1
  dbid: RIE
  name: IEEE/IET Electronic Library
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1932-4537
EndPage 219
ExternalDocumentID 10_1109_TNSM_2019_2891826
8606104
Genre orig-research
GroupedDBID 0R~
4.4
5VS
6IK
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABJNI
ABQJQ
ABVLG
ACGFO
ACIWK
AENEX
AETIX
AGQYO
AGSQL
AHBIQ
AIBXA
AKJIK
AKQYR
ALMA_UNASSIGNED_HOLDINGS
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
EBS
EJD
HZ~
IES
IFIPE
IPLJI
JAVBF
LAI
M43
O9-
OCL
P2P
RIA
RIE
AAYXX
CITATION
RIG
ID FETCH-LOGICAL-c293t-decd3ae0a5d2cf5bd7dc9beb0292f87738532816a866633ba6365d2e93aa647a3
IEDL.DBID RIE
ISSN 1932-4537
IngestDate Mon Jun 30 08:41:05 EDT 2025
Thu Apr 24 22:53:21 EDT 2025
Tue Jul 01 01:55:16 EDT 2025
Wed Aug 27 02:36:28 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 1
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
https://doi.org/10.15223/policy-029
https://doi.org/10.15223/policy-037
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c293t-decd3ae0a5d2cf5bd7dc9beb0292f87738532816a866633ba6365d2e93aa647a3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0002-2825-5430
PQID 2191150745
PQPubID 85504
PageCount 14
ParticipantIDs proquest_journals_2191150745
crossref_primary_10_1109_TNSM_2019_2891826
ieee_primary_8606104
crossref_citationtrail_10_1109_TNSM_2019_2891826
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2019-March
2019-3-00
20190301
PublicationDateYYYYMMDD 2019-03-01
PublicationDate_xml – month: 03
  year: 2019
  text: 2019-March
PublicationDecade 2010
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle IEEE eTransactions on network and service management
PublicationTitleAbbrev T-NSM
PublicationYear 2019
Publisher IEEE
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References ref13
ref12
ref15
ref14
ref53
ref52
ref11
ref17
ref16
ref19
al-fares (ref45) 2010; 10
ref51
ref50
(ref34) 2007
ref46
ref42
mahapatra (ref41) 2010
ref43
ref49
ref8
ref7
ref9
ref4
ref3
ref6
ref5
gulati (ref44) 2012; 1
shang (ref10) 2013
dósa (ref40) 2007
ref35
ref37
dósa (ref39) 2013; 20
ref36
ref31
ref30
ref33
ref32
ref1
ref38
koomey (ref2) 2011
(ref18) 2016
ref24
ref23
ref26
ref25
ref20
ref22
ref28
ref27
ref29
(ref47) 2018
heller (ref21) 2010
williams (ref48) 2014
References_xml – ident: ref28
  doi: 10.1109/GLOCOM.2012.6503497
– ident: ref31
  doi: 10.1109/JSAC.2014.140102
– ident: ref14
  doi: 10.1109/ICNP.2010.5762751
– year: 2007
  ident: ref34
  publication-title: Cisco Data Center Infrastructure 2 5 Design Guide
– start-page: 1
  year: 2010
  ident: ref41
  article-title: Load balancing mechanisms in data center networks
  publication-title: Proc IEEE Int Conf Expo Emerg Technol Smarter World (CEWIT)
– ident: ref43
  doi: 10.1109/2.841785
– ident: ref12
  doi: 10.1109/TCC.2015.2511720
– ident: ref13
  doi: 10.1109/ICDCS.2017.138
– ident: ref46
  doi: 10.1109/GreenCom-iThings-CPSCom.2013.28
– start-page: 1
  year: 2007
  ident: ref40
  article-title: The tight bound of first fit decreasing bin-packing algorithm is $FFD (I) \leq11/9OPT(I)+ 6/9$
  publication-title: Proc Comb Algorithms Probab Exp Methodol
– volume: 10
  start-page: 89
  year: 2010
  ident: ref45
  article-title: Hedera: Dynamic flow scheduling for data center networks
  publication-title: Proc NSDI
– ident: ref33
  doi: 10.1109/TNSM.2015.2436408
– ident: ref7
  doi: 10.1109/GLOCOM.2014.7037143
– ident: ref37
  doi: 10.1145/2975159
– ident: ref23
  doi: 10.1145/2079296.2079314
– ident: ref27
  doi: 10.1145/2208828.2208831
– year: 2011
  ident: ref2
  publication-title: Growth in Data Center Electricity Use 2005 to 2010
– ident: ref32
  doi: 10.1109/TNSM.2015.2443838
– ident: ref8
  doi: 10.1145/1868447.1868455
– ident: ref20
  doi: 10.1145/1851275.1851191
– ident: ref16
  doi: 10.1016/j.comnet.2013.12.006
– ident: ref22
  doi: 10.1109/INFCOM.2012.6195471
– ident: ref15
  doi: 10.1145/1851290.1851292
– ident: ref49
  doi: 10.1109/TCC.2015.2424892
– ident: ref51
  doi: 10.1145/1879141.1879175
– year: 2016
  ident: ref18
  publication-title: CPLEX 12 5 User's Manual
– ident: ref4
  doi: 10.1109/ICDCSW.2009.44
– ident: ref30
  doi: 10.1145/2567529.2567560
– start-page: 249
  year: 2010
  ident: ref21
  article-title: ElasticTree: Saving energy in data center networks
  publication-title: Proc NSDI Conf
– ident: ref19
  doi: 10.1145/1816038.1816004
– volume: 1
  start-page: 45
  year: 2012
  ident: ref44
  article-title: VMWare distributed resource management: Design, implementation, and lessons learned
  publication-title: VMware Technical Journal
– ident: ref38
  doi: 10.1109/TPDS.2014.2350990
– ident: ref53
  doi: 10.1109/ICDCS.2014.33
– ident: ref6
  doi: 10.1145/2038916.2038918
– year: 2018
  ident: ref47
  publication-title: Cisco Nexus 7000 Series Site Preparation Guide-Technical Specifications [Cisco Nexus 7000 Series Switches]
– volume: 20
  start-page: 1
  year: 2013
  ident: ref39
  article-title: First fit bin packing: A tight analysis
  publication-title: Leibniz International Proceedings in Informatics
– ident: ref35
  doi: 10.1016/j.future.2013.07.006
– ident: ref24
  doi: 10.1109/NCA.2013.24
– ident: ref52
  doi: 10.1109/TCC.2015.2511732
– start-page: 1
  year: 2013
  ident: ref10
  article-title: Greening data center networks with flow preemption and energy-aware routing
  publication-title: Proc 15th IEEE Workshop Local and Metropolitan Area Networks (LANMAN)
– ident: ref9
  doi: 10.1145/1592681.1592693
– ident: ref29
  doi: 10.1109/IPDPS.2013.100
– ident: ref26
  doi: 10.23919/IFIPNetworking.2017.8264860
– ident: ref36
  doi: 10.1002/cpe.2963
– ident: ref17
  doi: 10.1145/1402946.1402967
– ident: ref42
  doi: 10.1007/s11227-010-0504-1
– ident: ref50
  doi: 10.1007/s10586-014-0404-x
– ident: ref11
  doi: 10.1109/TNSM.2017.2711567
– year: 2014
  ident: ref48
  publication-title: Core I7-5960x Extreme Edition Review Intel's Overdue Desktop 8-Core 1119 Is Here
– ident: ref3
  doi: 10.1145/2377677.2377719
– ident: ref1
  doi: 10.1016/j.comcom.2013.11.005
– ident: ref25
  doi: 10.1109/IPDPS.2015.22
– ident: ref5
  doi: 10.1109/CLOUD.2011.74
SSID ssj0058192
Score 2.2366266
Snippet Today's data center networks (DCNs) tend to have tens to hundreds of thousands of servers that provide massive and sophisticated services. The architectural...
Today’s data center networks (DCNs) tend to have tens to hundreds of thousands of servers that provide massive and sophisticated services. The architectural...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 206
SubjectTerms Algorithms
Computer centers
Computer simulation
Computing time
Data center networks
Data centers
Electronic devices
Energy
Energy conservation
Energy consumption
energy saving
Fault tolerance
Heuristic
Heuristic algorithms
Heuristic methods
Links
load balancing
Load management
Mixed integer
Network topology
Performance degradation
Provisioning
Routing
Safety
Servers
Surges
Switches
Switching theory
Utilization
Title Performance-Aware Energy Saving for Data Center Networks
URI https://ieeexplore.ieee.org/document/8606104
https://www.proquest.com/docview/2191150745
Volume 16
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LS8NAEF5qT3rwVcVqlRw8iUmT3SSbPRZtKUKL0BZ6C_uYvSittCmCv97dTVKfiLdAZsMys5nXznyD0DUmWmkttK8U5X6csMQXkmjfBFspAxph4eanjMbpcBY_zJN5A91ue2EAwBWfQWAf3V2-WsqNTZV1M-NtRxb8c8cEbmWvVq11EwvsVd1aRiHrTseTkS3cYoGJKKwP_cXuuEEqP7SvMymDAzSqN1NWkjwFm0IE8u0bTuN_d3uI9ivf0uuVh-EINWBxjPY-IQ62UPb40Sjg9175Cry-6_7zJtymFjzz0rvnBfds2hdW3rgsE1-foNmgP70b-tXwBF8aC174CqQiHEKeKCx1IhRVkgkQIWZYZ9SC2BCcRSnPTABDiOApSQ0pMMJ5GlNOTlFzsVzAGfKAJkKnWGuLLUeZZCBN3MM5obECjKGNwpq1uayQxe2Ai-fcRRghy600ciuNvJJGG91sl7yUsBp_Ebcsd7eEFWPbqFPLL69-vHVuFLDzcePk_PdVF2jXfrssI-ugZrHawKXxKwpx5Q7UO8ujytI
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LS8NAEB6KHtSDb7FaNQdPYmq6m02yx6KVqm0RbMFb2MfsRalSUwR_vbubtD4Rb4HMkmVmM6-d-QbgmFCjjZEm1DoVYcw4C6WiJrTBVsIxbRHp56f0B0l3FF_fs_sanM57YRDRF59h0z36u3z9pKYuVXaWWW-75cA_F63dZ6Ts1prpXeagvap7y1bEz4aDu74r3eJNG1M4L_qL5fGjVH7oX29ULtegP9tOWUvy0JwWsqneviE1_ne_67BaeZdBuzwOG1DD8SasfMIc3ILs9qNVIGy_igkGHd__F9wJl1wI7MvgQhQicIlfnASDslD8ZRtGl53heTesxieEytrwItSoNBUYCaaJMkzqVCsuUUaEE5OlDsaGkqyViMyGMJRKkdDEkiKnQiRxKugOLIyfxrgLAaZMmoQY49DlUq44Khv5CEHTWCMhWIdoxtpcVdjibsTFY-5jjIjnThq5k0ZeSaMOJ_MlzyWwxl_EW467c8KKsXVozOSXV7_eS25VsPdyY7b3-6ojWOoO-728dzW42Ydl952yqKwBC8VkigfWyyjkoT9c7467zhw
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Performance-Aware+Energy+Saving+for+Data+Center+Networks&rft.jtitle=IEEE+eTransactions+on+network+and+service+management&rft.au=Al-Tarazi%2C+Motassem&rft.au=Chang%2C+J.+Morris&rft.date=2019-03-01&rft.pub=IEEE&rft.eissn=1932-4537&rft.volume=16&rft.issue=1&rft.spage=206&rft.epage=219&rft_id=info:doi/10.1109%2FTNSM.2019.2891826&rft.externalDocID=8606104
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1932-4537&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1932-4537&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1932-4537&client=summon