The Trade-Offs between Optimality and Feasibility in Online Routing with Dedicated Path Protection in Elastic Optical Networks
Open Access
Abstract
The article discusses an online problem of routing and spectrum allocation with dedicated path protection in elastic optical networks. We propose three novel algorithms to solve this problem. The first of them is the minimum-cost–maximum-flow heuristic algorithm, which calculates the solution assuming that the spectrum units on the working and dedicated backup path are the same. Such an assumption, on the one hand, increases the bandwidth blocking probability; however, on the other hand, it enables a simple, cheap and fast way to connect customers to the network during the implementation phase of elastic optical networks. The next two algorithms, which determine the exact solutions, are based on the branch and bound method. The first calculates the working and dedicated backup paths with the minimum total occupied bandwidth, called the total cost, while the second calculates the paths with the minimum total length. These algorithms enable the performance evaluation of the proposed heuristic algorithm and provide the answer as to what should be optimized, the total cost or the total length of paths, in order to minimize the bandwidth blocking probability. Extensive simulation research has shown that the proposed heuristic algorithm can be used in elastic optical networks, but with a small network load. Moreover, it is shown that the optimization of the total cost of paths provides a slightly lower blocking probability than the optimization of the total length of paths.Keywords
This publication has 11 references indexed in Scilit:
- Modulation-Adaptive Link-Disjoint Path Selection Model for 1 + 1 Protected Elastic Optical NetworksIEEE Access, 2019
- Path protection in optical flexible networks with distance-adaptive modulation formats2018
- Energy Efficiency of Dynamic Routing in Elastic Optical Networks with Back-to-Back Regeneration2018
- An efficient hybrid protection scheme with shared/dedicated backup paths on elastic optical networksDigital Communications and Networks, 2017
- Routing and Spectrum Allocation in Elastic Optical Networks: A TutorialIEEE Communications Surveys & Tutorials, 2015
- Distance Adaptive Dynamic Routing and Spectrum Allocation in Elastic Optical Networks with Shared Backup Path ProtectionJournal of Lightwave Technology, 2015
- Routing and spectrum allocation algorithms for elastic optical networks with dedicated path protectionOptical Switching and Networking, 2014
- Optimal Design for Shared Backup Path Protected Elastic Optical Networks Under Single-Link FailureJournal of Optical Communications and Networking, 2014
- Survivable Traffic Grooming in Elastic Optical Networks—Shared ProtectionJournal of Lightwave Technology, 2012
- Bandwidth Squeezed Restoration in Spectrum-Sliced Elastic Optical Path Networks (SLICE)Journal of Optical Communications and Networking, 2011