Efficient Make-Before-Break Layer 2 Reoptimization
- 22 June 2021
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 29 (5) , 1910-1921
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.Keywords
Funding Information
- MITACS and Ciena Converge Awards
- Concordia University Research Chair
- Natural Sciences and Engineering Research Council of Canada (NSERC) Grant
- 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-15-IDEX-0001, ANR-17-EURE-0004)
- Inria Associated-Team Project Efficient Dynamic Resource Allocation in Networks (EfDyNet).s
This publication has 14 references indexed in Scilit:
- Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed PathwidthACM Journal of Experimental Algorithmics, 2016
- Survey of WDM network reconfiguration: topology migrations and their impact on service disruptionsTelecommunication Systems, 2015
- Wavelength Path Reconfiguration Design in Transparent Optical WDM NetworksJournal of Optical Communications and Networking, 2013
- Tradeoffs in process strategy games with application in the WDM reconfiguration problemTheoretical Computer Science, 2011
- Characterization of graphs and digraphs with small process numbersDiscrete Applied Mathematics, 2011
- Lightpath Reconfiguration in WDM NetworksJournal of Optical Communications and Networking, 2010
- On Rerouting Connection Requests in Networks with Shared BandwidthElectronic Notes in Discrete Mathematics, 2009
- Rerouting tunnels for MPLS network resource optimizationEuropean Journal of Operational Research, 2008
- On the solution of reroute sequence planning problem in MPLS networksComputer Networks, 2003
- Branch-and-Price: Column Generation for Solving Huge Integer ProgramsOperations Research, 1998