Green Multi-Stage Upgrade for Bundled-Link SDNs With Budget and Delay Constraints

Upgrading a legacy network to a Software Defined Network in stages, and minimizing the energy consumption of a network are now of great interest to operators. To this end, this paper addresses a novel problem: minimize the energy consumption of a network by upgrading switches over multiple stages su...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on green communications and networking Vol. 5; no. 3; pp. 1410 - 1425
Main Authors Hiryanto, Lely, Soh, Sieteng, Chin, Kwan-Wu, Lazarescu, Mihai
Format Journal Article
LanguageEnglish
Published Piscataway IEEE 01.09.2021
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text
ISSN2473-2400
2473-2400
DOI10.1109/TGCN.2021.3082617

Cover

Abstract Upgrading a legacy network to a Software Defined Network in stages, and minimizing the energy consumption of a network are now of great interest to operators. To this end, this paper addresses a novel problem: minimize the energy consumption of a network by upgrading switches over multiple stages subject to the available monetary budget at each stage. Our problem considers (i) bundled links that can be powered-off individually, (ii) decreasing upgrade cost and increasing traffic demands over multiple stages, and (iii) rerouting demands to an alternative path with a delay that is within a predefined limit. Additionally, the link load on the path is no larger than a given maximum utilization. We formulate the problem as an Integer Linear Program and propose a greedy heuristic called Green Multi-Stage Switch Upgrade (GMSU). Experiment results on five actual network topologies show that: 1) our approaches reduce the energy consumption by up to 73.98%; 2) rerouting traffic demand via longer paths improves the energy saving by up to 9.6%; 3) GMSU produces results that are at most 4.83% from the optimal result; and 4) increasing the budget and the number of stages affect the total energy saved and the number of upgraded switches.
AbstractList Upgrading a legacy network to a Software Defined Network in stages, and minimizing the energy consumption of a network are now of great interest to operators. To this end, this paper addresses a novel problem: minimize the energy consumption of a network by upgrading switches over multiple stages subject to the available monetary budget at each stage. Our problem considers (i) bundled links that can be powered-off individually, (ii) decreasing upgrade cost and increasing traffic demands over multiple stages, and (iii) rerouting demands to an alternative path with a delay that is within a predefined limit. Additionally, the link load on the path is no larger than a given maximum utilization. We formulate the problem as an Integer Linear Program and propose a greedy heuristic called Green Multi-Stage Switch Upgrade (GMSU). Experiment results on five actual network topologies show that: 1) our approaches reduce the energy consumption by up to 73.98%; 2) rerouting traffic demand via longer paths improves the energy saving by up to 9.6%; 3) GMSU produces results that are at most 4.83% from the optimal result; and 4) increasing the budget and the number of stages affect the total energy saved and the number of upgraded switches.
Author Soh, Sieteng
Lazarescu, Mihai
Hiryanto, Lely
Chin, Kwan-Wu
Author_xml – sequence: 1
  givenname: Lely
  orcidid: 0000-0002-9441-5551
  surname: Hiryanto
  fullname: Hiryanto, Lely
  email: lely.hiryanto@postgrad.curtin.edu.au
  organization: School of Electrical Engineering, Computing and Mathematical Sciences, Curtin University, Perth, WA, Australia
– sequence: 2
  givenname: Sieteng
  orcidid: 0000-0001-8974-3158
  surname: Soh
  fullname: Soh, Sieteng
  email: lely.hiryanto@gmail.com
  organization: School of Electrical Engineering, Computing and Mathematical Sciences, Curtin University, Perth, WA, Australia
– sequence: 3
  givenname: Kwan-Wu
  orcidid: 0000-0003-1547-9272
  surname: Chin
  fullname: Chin, Kwan-Wu
  email: kwanwu@uow.edu.au
  organization: School of Electrical, Computer, and Telecommunications Engineering, University of Wollongong, Wollongong, NSW, Australia
– sequence: 4
  givenname: Mihai
  orcidid: 0000-0002-4394-4293
  surname: Lazarescu
  fullname: Lazarescu, Mihai
  email: m.lazarescu@curtin.edu.au
  organization: School of Electrical Engineering, Computing and Mathematical Sciences, Curtin University, Perth, WA, Australia
BookMark eNp9kDFPwzAQhS1UJErpD0AslphT7HMcJyOkUJBKEWorRstJnJISnGI7Q_89iVohxMB0p9P77t29czQwjdEIXVIyoZQkN6tZupgAATphJIaIihM0hFCwAEJCBr_6MzR2bksIgYTTKGFD9DqzWhv83Na-CpZebTRe7zZWFRqXjcV3rSlqXQTzynzg5XTh8Fvl37txsdEeK1Pgqa7VHqeNcd6qynh3gU5LVTs9PtYRWj_cr9LHYP4ye0pv50EOCfMB491VnALjPKelAhqFIgMR5SzKgHIuVJkXMcuyJBOK5BriMCIZAE8UC7O4ZCN0fdi7s81Xq52X26a1prOUwKMQGFCRdCp6UOW2cc7qUu5s9ansXlIi-_BkH57sw5PH8DpG_GHyyitfNaZ_sf6XvDqQldb6xykJWRwBZd867XuS
CitedBy_id crossref_primary_10_1109_ACCESS_2022_3197217
crossref_primary_10_1093_comjnl_bxae105
crossref_primary_10_1109_ACCESS_2021_3093899
Cites_doi 10.1109/TGCN.2018.2842123
10.1109/MNET.2017.1600182
10.1016/j.comnet.2016.12.012
10.1109/GLOCOM.2016.7841561
10.1016/j.comnet.2014.06.002
10.1145/2486001.2486019
10.1109/SDS.2018.8370432
10.1016/j.jnca.2017.10.003
10.1109/TC.2015.2451662
10.1287/mnsc.17.11.712
10.1145/1851290.1851297
10.1145/1096536.1096551
10.1109/MVT.2018.2814022
10.1145/863955.863959
10.1109/ITNAC46935.2019.9077927
10.1109/IWCMC.2018.8450267
10.1109/TPDS.2015.2394794
10.1109/LCOMM.2015.2394457
10.1109/INFCOM.2013.6567024
10.1145/2486001.2486012
10.1109/MCOM.2010.5621967
10.1109/GLOCOM.2013.6831268
10.1109/INFOCOM.2017.8057136
10.1109/JCN.2016.000079
10.1016/j.csi.2017.04.001
10.1109/ICNP.2010.5762751
10.1016/j.comnet.2013.03.006
10.1109/SFCS.1975.21
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2021
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2021
DBID 97E
RIA
RIE
AAYXX
CITATION
7SP
8FD
L7M
DOI 10.1109/TGCN.2021.3082617
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005–Present
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library (IEL)
CrossRef
Electronics & Communications Abstracts
Technology Research Database
Advanced Technologies Database with Aerospace
DatabaseTitle CrossRef
Technology Research Database
Advanced Technologies Database with Aerospace
Electronics & Communications Abstracts
DatabaseTitleList Technology Research Database

Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 2473-2400
EndPage 1425
ExternalDocumentID 10_1109_TGCN_2021_3082617
9438621
Genre orig-research
GrantInformation_xml – fundername: Australian Government through the Department of Foreign Affairs and Trade
  funderid: 10.13039/501100000996
GroupedDBID 0R~
6IK
97E
AAJGR
AASAJ
AAWTH
ABAZT
ABJNI
ABQJQ
ABVLG
ACGFS
AGQYO
AHBIQ
AKJIK
ALMA_UNASSIGNED_HOLDINGS
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
EBS
EJD
IES
IFIPE
IPLJI
JAVBF
OCL
RIA
RIE
AAYXX
CITATION
M~E
7SP
8FD
L7M
ID FETCH-LOGICAL-c293t-35247512355c1fa21647b276c36b21557afcd83bb9b7a0ce28460b2259a34b8f3
IEDL.DBID RIE
ISSN 2473-2400
IngestDate Fri Jul 25 08:01:31 EDT 2025
Tue Jul 01 01:08:38 EDT 2025
Thu Apr 24 23:10:14 EDT 2025
Wed Aug 27 02:27:57 EDT 2025
IsPeerReviewed false
IsScholarly true
Issue 3
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-35247512355c1fa21647b276c36b21557afcd83bb9b7a0ce28460b2259a34b8f3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0001-8974-3158
0000-0002-9441-5551
0000-0003-1547-9272
0000-0002-4394-4293
PQID 2564232179
PQPubID 4437214
PageCount 16
ParticipantIDs crossref_primary_10_1109_TGCN_2021_3082617
crossref_citationtrail_10_1109_TGCN_2021_3082617
proquest_journals_2564232179
ieee_primary_9438621
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2021-09-01
PublicationDateYYYYMMDD 2021-09-01
PublicationDate_xml – month: 09
  year: 2021
  text: 2021-09-01
  day: 01
PublicationDecade 2020
PublicationPlace Piscataway
PublicationPlace_xml – name: Piscataway
PublicationTitle IEEE transactions on green communications and networking
PublicationTitleAbbrev TGCN
PublicationYear 2021
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
ref11
toth (ref28) 1990
ref32
ref10
ref2
ref1
ref17
ref16
ref19
ref18
roughan (ref34) 2017
(ref31) 2019
ref24
ref26
(ref23) 2013
ref25
(ref35) 2019
ref20
(ref33) 2018
ref22
ref21
(ref30) 2019
ref27
ref29
ref8
ref7
ref9
ref4
(ref36) 2020
ref3
ref6
ref5
References_xml – ident: ref21
  doi: 10.1109/TGCN.2018.2842123
– ident: ref25
  doi: 10.1109/MNET.2017.1600182
– ident: ref8
  doi: 10.1016/j.comnet.2016.12.012
– year: 2017
  ident: ref34
  publication-title: Internet Traffic Matrices
– ident: ref16
  doi: 10.1109/GLOCOM.2016.7841561
– ident: ref14
  doi: 10.1016/j.comnet.2014.06.002
– ident: ref1
  doi: 10.1145/2486001.2486019
– year: 2013
  ident: ref23
  publication-title: Openflow Switch Specification Version 1 3 0 (Wire Protocol 0x04)
– ident: ref10
  doi: 10.1109/SDS.2018.8370432
– ident: ref3
  doi: 10.1016/j.jnca.2017.10.003
– ident: ref20
  doi: 10.1109/TC.2015.2451662
– ident: ref29
  doi: 10.1287/mnsc.17.11.712
– ident: ref7
  doi: 10.1145/1851290.1851297
– ident: ref32
  doi: 10.1145/1096536.1096551
– year: 2019
  ident: ref30
  publication-title: Gurobi Optimizer Reference Manual
– ident: ref18
  doi: 10.1109/MVT.2018.2814022
– ident: ref6
  doi: 10.1145/863955.863959
– ident: ref24
  doi: 10.1109/ITNAC46935.2019.9077927
– ident: ref17
  doi: 10.1109/IWCMC.2018.8450267
– ident: ref13
  doi: 10.1109/TPDS.2015.2394794
– year: 2018
  ident: ref33
  publication-title: Yin Zhang's Abilene Traffic Matrix
– year: 2019
  ident: ref31
  publication-title: The Internet Topology Zoo
– ident: ref15
  doi: 10.1109/LCOMM.2015.2394457
– ident: ref26
  doi: 10.1109/INFCOM.2013.6567024
– year: 1990
  ident: ref28
  publication-title: Knapsack Problems Algorithms and Computer Implementations
– ident: ref2
  doi: 10.1145/2486001.2486012
– ident: ref9
  doi: 10.1109/MCOM.2010.5621967
– year: 2020
  ident: ref36
  publication-title: Annual Energy Outlook 2019
– year: 2019
  ident: ref35
  publication-title: Publicly Available Code
– ident: ref22
  doi: 10.1109/GLOCOM.2013.6831268
– ident: ref4
  doi: 10.1109/INFOCOM.2017.8057136
– ident: ref19
  doi: 10.1109/JCN.2016.000079
– ident: ref5
  doi: 10.1016/j.csi.2017.04.001
– ident: ref11
  doi: 10.1109/ICNP.2010.5762751
– ident: ref12
  doi: 10.1016/j.comnet.2013.03.006
– ident: ref27
  doi: 10.1109/SFCS.1975.21
SSID ssj0002951693
Score 2.1847942
Snippet Upgrading a legacy network to a Software Defined Network in stages, and minimizing the energy consumption of a network are now of great interest to operators....
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 1410
SubjectTerms budget constraint
Budgets
bundled links
Control systems
Delays
Energy consumption
energy saving
Hybrid SDNs
maximum path delay
multi-stage upgrade
Network topologies
Rerouteing
Routing
single path routing
Software
Software-defined networking
Switches
Topology
Title Green Multi-Stage Upgrade for Bundled-Link SDNs With Budget and Delay Constraints
URI https://ieeexplore.ieee.org/document/9438621
https://www.proquest.com/docview/2564232179
Volume 5
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LT8MwDI5gJzjwGojBQDlwQqTrI2nXI2wMhMQkBBPcqrw6EGgg1h3g12OnXUGAELeqTaooTuLPsf2ZkIMgyXXs84DFQgvGQymY5KliVnP4EGusi4LRFsP4fMQv7sTdAjmqc2GstS74zHr46Hz55lnP8Kqsk_IIADjYOouwzMpcrfo-JUzR4xNVjsvATzs3Z70hGIBh4CElS-xKkn2qHldL5ccB7LTKYJVczsdTBpM8erNCefr9G1Xjfwe8RlYqeEmPy_WwThbsZIMsfyEdbJIrF2pDXeYtA6w5tnT0Mn6VxlIAsPRkhrQLhqGRSq_7wym9fSju4bUZ24LKiaF9-yTfKFb6dPUliukmGQ1Ob3rnrCqswDRo94IB6OKJwCxZoYNchsgppsIk1lGsAAKIRObadCOlUpVIX1tQYbGvYOenMuKqm0dbpDF5nthtQi2XwldglOSB4cKA_udG4WVSGFkFBnCL-PM5z3TFOo6De8qc9eGnGYopQzFllZha5LDu8lJSbvzVuInTXjesZrxF2nPBZtWmnGaA7tAtDUfQzu-9dskS_rsMIWuTRvE6s3uAOQq17xbbBx_g0QQ
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LT-MwEB4hOMAeeO6K8vSBE8IlDzshR97dBSqhbbXcIr9SEFVBND3Ar2fGSQuCFeIWJbZieWzPN56ZbwB2wrQwSSBCnkgjuYiU5Epkmjsj8ENiqC4KRVu0k1ZX_LmRN1OwN8mFcc754DPXpEfvy7cPZkRXZfuZiBGAo60zg3pfyCpba3KjEmXk84lr12UYZPud8-M2moBR2CRSlsQXJXtTPr6ayqcj2OuVswW4Go-oCie5b45K3TQvH8gavzvkRZivASY7rFbEEky5wTL8eEc7uALXPtiG-dxbjmiz51j3sfekrGMIYdnRiIgXLCczlf09aQ_Zv7vyFl_bniuZGlh24vrqmVGtT19hohz-hO7Zaee4xevSCtygfi85wi6RSsqTlSYsVESsYjpKExMnGkGATFVh7EGsdaZTFRiHSiwJNO79TMVCHxTxL5gePAzcKjAnlAw0miVFaIW0iACE1XSdFMVOowncgGA857mpecdpcP3c2x9BlpOYchJTXoupAbuTLo8V6cZXjVdo2icN6xlvwMZYsHm9LYc54jtyTOMhtPb_Xtsw2-pcXeaXv9sX6zBH_6kCyjZgunwauU1EIKXe8gvvFT4N1FE
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=Green+Multi-Stage+Upgrade+for+Bundled-Link+SDNs+With+Budget+and+Delay+Constraints&rft.jtitle=IEEE+transactions+on+green+communications+and+networking&rft.au=Hiryanto%2C+Lely&rft.au=Soh%2C+Sieteng&rft.au=Chin%2C+Kwan-Wu&rft.au=Lazarescu%2C+Mihai&rft.date=2021-09-01&rft.pub=IEEE&rft.eissn=2473-2400&rft.volume=5&rft.issue=3&rft.spage=1410&rft.epage=1425&rft_id=info:doi/10.1109%2FTGCN.2021.3082617&rft.externalDocID=9438621
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2473-2400&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2473-2400&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2473-2400&client=summon