Efficient Make-Before-Break Layer 2 Reoptimization

Optical multilayer optimization periodically reorganizes layer 0-1-2 network elements to handle both existing and dynamic traffic requirements in the most efficient manner. This delays the need for adding new resources in order to cope with the evolution of the traffic, thus saving CAPEX. The focus...

Full description

Saved in:
Bibliographic Details
Published inIEEE/ACM transactions on networking Vol. 29; no. 5; pp. 1910 - 1921
Main Authors Duong, Huy, Jaumard, Brigitte, Coudert, David, Armolavicius, Romualdas
Format Journal Article
LanguageEnglish
Published New York IEEE 01.10.2021
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
IEEE/ACM
Subjects
Online AccessGet full text

Cover

Loading…
Abstract Optical multilayer optimization periodically reorganizes layer 0-1-2 network elements to handle both existing and dynamic traffic requirements in the most efficient manner. This delays the need for adding new resources in order to cope with the evolution of the traffic, thus saving CAPEX. The focus of this paper is on Layer 2, i.e., on capacity reoptimization at the optical transport network (OTN) layer when routes (e.g., LSPs in MPLS networks) are making unnecessarily long detours to evade congestion. Reconfiguration into optimized routes can be achieved by re-defining the routes, one at a time, so that they use the vacant resources generated by the disappearance of services using part of a path that transits the congested section. To maintain the Quality of Service, it is desirable to operate under a Make-Before-Break (MBB) paradigm, with the minimum number of reroutings. The challenge is to determine the best rerouting order while minimizing the bandwidth requirement. We propose an exact and scalable optimization model for computing a minimum bandwidth rerouting scheme subject to MBB in the OTN layer of an optical network. Numerical results show that we can successfully apply it on networks with up to 30 nodes, a very significant improvement with respect to the state of the art. We also provide some reoptimization analysis in terms of the bandwidth requirement vs. the number of reroutings.
AbstractList Optical multilayer optimization periodically reorganizes layer 0-1-2 network elements to handle both existing and dynamic traffic requirements in the most efficient manner. This delays the need for adding new resources in order to cope with the evolution of the traffic, thus saving CAPEX. The focus of this paper is on Layer 2, i.e., on capacity reoptimization at the optical transport network (OTN) layer when routes (e.g., LSPs in MPLS networks) are making unnecessarily long detours to evade congestion. Reconfiguration into optimized routes can be achieved by re-defining the routes, one at a time, so that they use the vacant resources generated by the disappearance of services using part of a path that transits the congested section. To maintain the Quality of Service, it is desirable to operate under a Make-Before-Break (MBB) paradigm, with the minimum number of reroutings. The challenge is to determine the best rerouting order while minimizing the bandwidth requirement. We propose an exact and scalable optimization model for computing a minimum bandwidth rerouting scheme subject to MBB in the OTN layer of an optical network. Numerical results show that we can successfully apply it on networks with up to 30 nodes, a very significant improvement with respect to the state of the art. We also provide some reoptimization analysis in terms of the bandwidth requirement vs. the number of reroutings.
Optical multilayer optimization periodically reorganizes layer 0-1-2 network elements to handle both existing and dynamic traffic requirements in the most efficient manner. This delays the need for adding new resources in order to cope with the evolution of the traffic, thus saving CAPEX.The focus of this paper is on Layer 2, i.e., on capacity reoptimization at the optical transport network (OTN) layer when routes (e.g., LSPs in MPLS networks) are making unnecessarily long detours to evade congestion. Reconfiguration into optimized routes can be achieved by redefining the routes, one at a time, so that they use the vacant resources generated by the disappearance of services using part of a path that transits the congested section. To maintain the Quality of Service, it is desirable to operate under a Make-Before-Break (MBB) paradigm, with the minimum number of reroutings. The challenge is to determine the best rerouting order while minimizing the bandwidth requirement.We propose an exact and scalable optimization model for computing a minimum bandwidth rerouting scheme subject to MBB in the OTN layer of an optical network. Numerical results show that we can successfully apply it on networks with up to 30 nodes, a very significant improvement with respect to the state of the art. We also provide some reoptimization analysis in terms of the bandwidth requirement vs. the number of reroutings.
Author Coudert, David
Jaumard, Brigitte
Duong, Huy
Armolavicius, Romualdas
Author_xml – sequence: 1
  givenname: Huy
  surname: Duong
  fullname: Duong, Huy
  organization: Centre de Recherche Informatique de Montréal (CRIM), Montreal, Canada
– sequence: 2
  givenname: Brigitte
  orcidid: 0000-0003-3443-4918
  surname: Jaumard
  fullname: Jaumard, Brigitte
  email: bjaumard@cse.concordia.ca
  organization: Department of Computer Science and Software Engineering, Concordia University, Montreal, Canada
– sequence: 3
  givenname: David
  orcidid: 0000-0002-3306-8314
  surname: Coudert
  fullname: Coudert, David
  organization: Inria, I3S, CNRS, Université Côte d'Azur, Sophia Antipolis, France
– sequence: 4
  givenname: Romualdas
  surname: Armolavicius
  fullname: Armolavicius, Romualdas
  organization: Ciena, Ottawa, Canada
BackLink https://inria.hal.science/hal-03274803$$DView record in HAL
BookMark eNp9kE1PwzAMhiM0JLbBD0BcKnHi0JE4aZoeBxoMaYCExjnKUkdkH-1IO6Tx62nptAMHTras57WtZ0B6RVkgIZeMjhij2e38ZTIfAQU24jRViWInpM-SRMWQSNlreip5LGUGZ2RQVUtKGacg-wQmznnrsaijZ7PC-A5dGZoS0KyimdljiCB6w3Jb-43_NrUvi3Ny6sy6wotDHZL3h8n8fhrPXh-f7sez2PKU1s1h4yRY4HkGmKVgWW6lsFxIyqlcZLmRuRTGMoFoVOKsTPiCpY4CRcGF4kNy0-39MGu9DX5jwl6XxuvpeKbbGeWQCkX5F2vY647dhvJzh1Wtl-UuFM17GhIF0GJJQ7GOsqGsqoDuuJZR3WrUrUbdatQHjU0m_ZOxvv71UAfj1_8mr7qkR8TjpUxIEFzxH1pifoQ
CODEN IEANEP
CitedBy_id crossref_primary_10_1016_j_yofte_2023_103571
Cites_doi 10.1007/s11235-015-0050-5
10.1016/j.endm.2009.02.015
10.1016/j.dam.2011.03.010
10.1016/j.comnet.2016.12.010
10.1109/DRCN.2003.1275334
10.1287/opre.46.3.316
10.1109/INFOCOM.2016.7524332
10.1145/2851494
10.1016/j.tcs.2011.05.002
10.1016/S1389-1286(03)00189-0
10.1364/JOCN.5.000751
10.1109/GLOCOM.2009.5426108
10.1016/j.ejor.2007.04.016
10.1364/JOCN.2.001010
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2021
Distributed under a Creative Commons Attribution 4.0 International License
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2021
– notice: Distributed under a Creative Commons Attribution 4.0 International License
DBID 97E
RIA
RIE
AAYXX
CITATION
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
1XC
VOOES
DOI 10.1109/TNET.2021.3078581
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005–Present
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library (IEL)
CrossRef
Computer and Information Systems Abstracts
Electronics & Communications Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
Hyper Article en Ligne (HAL)
Hyper Article en Ligne (HAL) (Open Access)
DatabaseTitle CrossRef
Technology Research Database
Computer and Information Systems Abstracts – Academic
Electronics & Communications Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
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
Computer Science
EISSN 1558-2566
EndPage 1921
ExternalDocumentID oai_HAL_hal_03274803v1
10_1109_TNET_2021_3078581
9462438
Genre orig-research
GrantInformation_xml – fundername: MITACS and Ciena Converge Awards
  funderid: 10.13039/501100004489
– fundername: Natural Sciences and Engineering Research Council of Canada (NSERC) Grant
  funderid: 10.13039/501100000038
– fundername: French Government through the UCAJEDI and Université Côte d’Azur (UCA) Digital Systems for Humans (DS4H) Investments in the Future projects managed by the National Research Agency (ANR)
  grantid: ANR-15-IDEX-0001; ANR-17-EURE-0004
– fundername: Inria Associated-Team Project Efficient Dynamic Resource Allocation in Networks (EfDyNet).s
– fundername: Concordia University Research Chair (Tier I)
  funderid: 10.13039/501100002914
GroupedDBID -DZ
-~X
.DC
0R~
29I
4.4
5GY
5VS
6IK
85S
8US
97E
9M8
AAJGR
AAKMM
AALFJ
AARMG
AASAJ
AAWTH
AAWTV
ABAZT
ABPPZ
ABQJQ
ABVLG
ACGFS
ACGOD
ACIWK
ACM
ADBCU
ADL
AEBYY
AEFXT
AEJOY
AENSD
AETEA
AETIX
AFWIH
AFWXC
AGQYO
AGSQL
AHBIQ
AI.
AIBXA
AIKLT
AKJIK
AKQYR
AKRVB
ALLEH
ALMA_UNASSIGNED_HOLDINGS
ATWAV
BDXCO
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CCLIF
CS3
D0L
EBS
EJD
FEDTE
GUFHI
HF~
HGAVV
HZ~
H~9
I07
ICLAB
IEDLZ
IES
IFIPE
IFJZH
IPLJI
JAVBF
LAI
LHSKQ
M43
MVM
O9-
OCL
P1C
P2P
PQQKQ
RIA
RIE
RNS
ROL
TN5
UPT
UQL
VH1
XOL
YR2
ZCA
AAYOK
AAYXX
CITATION
RIG
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
1XC
VOOES
ID FETCH-LOGICAL-c370t-25af62c23d92e972c1dc64c3460306b9da6d64ac14eea85fc653b17f020e43483
IEDL.DBID RIE
ISSN 1063-6692
IngestDate Wed Aug 27 07:40:44 EDT 2025
Sun Jun 29 16:21:06 EDT 2025
Tue Jul 01 01:49:25 EDT 2025
Thu Apr 24 23:08:59 EDT 2025
Wed Aug 27 02:26:47 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 5
Keywords make-before-break
rerouting
Network reconfiguration
reoptimization
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c370t-25af62c23d92e972c1dc64c3460306b9da6d64ac14eea85fc653b17f020e43483
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0002-3306-8314
0000-0003-3443-4918
OpenAccessLink https://inria.hal.science/hal-03274803
PQID 2582248035
PQPubID 32020
PageCount 12
ParticipantIDs proquest_journals_2582248035
hal_primary_oai_HAL_hal_03274803v1
crossref_citationtrail_10_1109_TNET_2021_3078581
crossref_primary_10_1109_TNET_2021_3078581
ieee_primary_9462438
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2021-Oct.
2021-10-00
20211001
2021-10
PublicationDateYYYYMMDD 2021-10-01
PublicationDate_xml – month: 10
  year: 2021
  text: 2021-Oct.
PublicationDecade 2020
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle IEEE/ACM transactions on networking
PublicationTitleAbbrev TNET
PublicationYear 2021
Publisher IEEE
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
IEEE/ACM
Publisher_xml – name: IEEE
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
– name: IEEE/ACM
References ref13
cormen (ref16) 2001
ref12
ref14
ref10
ahuja (ref17) 1993
ref2
ref1
ref19
ref18
ref8
ref7
beker (ref11) 2003
coudert (ref3) 2009
ref9
ref4
ref6
ref5
chvatal (ref15) 1983
References_xml – ident: ref1
  doi: 10.1007/s11235-015-0050-5
– start-page: 1
  year: 2009
  ident: ref3
  article-title: Reconfiguration of the routing in WDM networks with two classes of services
  publication-title: Proc Conf Opt Netw Design Modeling (ONDM)
– ident: ref12
  doi: 10.1016/j.endm.2009.02.015
– ident: ref14
  doi: 10.1016/j.dam.2011.03.010
– ident: ref19
  doi: 10.1016/j.comnet.2016.12.010
– ident: ref5
  doi: 10.1109/DRCN.2003.1275334
– ident: ref18
  doi: 10.1287/opre.46.3.316
– ident: ref13
  doi: 10.1109/INFOCOM.2016.7524332
– ident: ref10
  doi: 10.1145/2851494
– start-page: 61
  year: 2003
  ident: ref11
  article-title: Off-line MPLS layout design and reconfiguration: Reducing complexity under dynamic traffic conditions
  publication-title: Proc Int Netw Optim Conf (INOC)
– ident: ref4
  doi: 10.1016/j.tcs.2011.05.002
– ident: ref2
  doi: 10.1016/S1389-1286(03)00189-0
– year: 1993
  ident: ref17
  publication-title: Network Flows Theory Algorithms and Applications
– ident: ref8
  doi: 10.1364/JOCN.5.000751
– ident: ref6
  doi: 10.1109/GLOCOM.2009.5426108
– year: 2001
  ident: ref16
  publication-title: Introduction to Algorithms
– ident: ref9
  doi: 10.1016/j.ejor.2007.04.016
– year: 1983
  ident: ref15
  publication-title: Linear Programming
– ident: ref7
  doi: 10.1364/JOCN.2.001010
SSID ssj0013026
Score 2.3690464
Snippet Optical multilayer optimization periodically reorganizes layer 0-1-2 network elements to handle both existing and dynamic traffic requirements in the most...
SourceID hal
proquest
crossref
ieee
SourceType Open Access Repository
Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 1910
SubjectTerms Bandwidth
Bandwidths
Computer Science
IEEE transactions
make-before-break
Multilayers
Multiprotocol label switching
Network reconfiguration
Networking and Internet Architecture
Numerical models
Optical communication
Optimization
Reconfiguration
reoptimization
Rerouteing
rerouting
Resource management
Routing
Traffic congestion
Title Efficient Make-Before-Break Layer 2 Reoptimization
URI https://ieeexplore.ieee.org/document/9462438
https://www.proquest.com/docview/2582248035
https://inria.hal.science/hal-03274803
Volume 29
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LS8NAEB7anvTgq4rVKkE8iWk3-0r2WKVSpO1BWugtbDYbhGor2nrw1zubpPWJeEoIM7Ds7M5-X3YeAOeEB0moZebTLFQ-FyLxlQzRGSI2Rc5MWZi53OHBUPbG_HYiJhW4XOfCWGvz4DPbcq_5XX46N0v3q6ytuKScRVWoInErcrU-bgxI3loNGQ7zpVS0vMEMiGqPht0RMkEatHBBRyIKvpxB1XsXAZm3Vvnhj_ND5mYbBqvhFbEl09ZykbTM27fKjf8d_w5slWjT6xTLYxcqdrYHm59qENaBdvMiEqjoDfTU-lcWYSw-EExOvb5GRO5R787O0bU8ljmb-zC-6Y6ue37ZSME3LCQLnwqdSWooSxW1KqQmSI3khnHpGEOiUi1TybUJuLU6EpmRgiVBmCGUtJzxiB1AbTaf2UPwpJYhqiTIwfHsp0ajR7UOBWWaCISHDSCrqY1NWWXcNbt4iHO2QVTsrBE7a8SlNRpwsVZ5Kkps_CV8hvZay7ni2L1OP3bfCEOGHRH2ikJ1N_lrqXLeG9BcmTcud-pLTIWLo0U1cfS71jFsuAEUAXxNqC2el_YEgcgiOc1X4DvOGdR-
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LT8MwDLZ4HIADb8R4VogToiPNq80R0NCAbQc0JG5RmqZCGmwINg78epy2G08hTq0qW0rt1P7c-AFwSHiUxkbmIc1jFXIh0lDJGI0hYlOMmSmLc1873O7I5i2_uhN3U3A8qYVxzhXJZ67ub4uz_GxgR_5X2YniknKWTMMs-n0RldVaH2cGpBiuhjEOC6VUtDrDjIg66XYaXYwFaVTHLZ2IJPrihabvfQ5kMVzlh0Uu3MzFErTHCyyzS3r10TCt27dvvRv_-wbLsFjhzeC03CArMOX6q7DwqQvhGtBG0UYCGYO26bnwzCGQxQvCyV7QMojJAxrcuAEal8eqanMdbi8a3fNmWI1SCC2LyTCkwuSSWsoyRZ2KqY0yK7llXPqYIVWZkZnkxkbcOZOI3ErB0ijOEUw6znjCNmCmP-i7TQikkTGypBiFo_en1qBNdR4H5YYIBIg1IGPRalv1GffjLh50EW8Qpb02tNeGrrRRg6MJy1PZZOMv4gPU14TOt8dunra0f0YYxtgJYa9ItOaFP6Gq5F6DnbF6dfWtvmgqfCYtsomt37n2Ya7Zbbd067JzvQ3zfjFlOt8OzAyfR24XYckw3St24zsTAdfH
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=Efficient+Make-Before-Break+Layer+2+Reoptimization&rft.jtitle=IEEE%2FACM+transactions+on+networking&rft.au=Duong%2C+Huy&rft.au=Jaumard%2C+Brigitte&rft.au=Coudert%2C+David&rft.au=Armolavicius%2C+Romualdas&rft.date=2021-10-01&rft.issn=1063-6692&rft.eissn=1558-2566&rft.volume=29&rft.issue=5&rft.spage=1910&rft.epage=1921&rft_id=info:doi/10.1109%2FTNET.2021.3078581&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_TNET_2021_3078581
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1063-6692&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1063-6692&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1063-6692&client=summon