Dynamic Buffering Cost-Saving Multi-Path Routing under Differential Delay Constraint in EONs

Zhang, Zhan; Yin, Shuo; Guo, Shijia; Lin, Zhien; Chen, Yidong; Huang, Shanguo

doi:10.1109/acp.2018.8596067

Cited by 4 publications

(2 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This algorithm aims to effectively reduce buffering costs by optimizing routing in the network. By introducing a multi-path routing algorithm that dynamically saves buffering costs, the network can use available paths more efficiently and reduce buffering costs and delays [23].…”

Section: Existing Studiesmentioning

confidence: 99%

A Single–Multi-Path Combinatorial RMSA Algorithm with Least Resource Consumption in Semi-Filterless Optical Networks

Yuan,

Xie,

Wang

et al. 2023

Photonics

View full text Add to dashboard Cite

Filterless optical networks (FONs) have become a cost-effective solution for optical network deployment due to their low-cost characteristics. However, eliminating active switching elements causes signals to propagate over unintended links, wasting spectral resources. Therefore, semi-filterless optical networks (Semi-FONs) have become a more cost-effective solution. This paper mainly studies the routing, modulation, and spectrum assignment (RMSA) problem in semi-filterless optical networks. It proposes a single–multi-path combination (LR-SMPC) RMSA algorithm with the least resource consumption. The algorithm first obtains the K shortest paths that satisfy the conditions according to the K short path (KSP) algorithm and re-orders the paths according to the resource consumption path re-ordering strategy, selecting the three paths that consume the least resources as the set of candidate paths. Then, based on the single–multi-path combination scheme of the set of candidate paths, the resource consumption of each scheme and the maximum number of available spectrum blocks for each path is calculated, from which the single path or multi-path with the least resource consumption is selected to serve the request. We perform simulation experiments on two network topologies using Poisson traffic models and compare them with existing single-path algorithms (S-P), fixed spectrum assignment granularity algorithms (g = 1), and adaptation spectrum assignment algorithms (g adaptation) to evaluate the performance of the proposed algorithm. The simulation results show that the proposed algorithm exhibits better performance in terms of both blocking rate and spectrum utilization.

show abstract

Section: Existing Studiesmentioning

confidence: 99%

A Single–Multi-Path Combinatorial RMSA Algorithm with Least Resource Consumption in Semi-Filterless Optical Networks

Yuan,

Xie,

Wang

et al. 2023

Photonics

View full text Add to dashboard Cite

show abstract

“…One disadvantage of multi-path routing techniques is that the different sub-lightpaths experience different end-to-end delays. Some works have addressed this drawback by setting constraints on the maximum differential delay between paths [74] [75], and have analyzed the impact on buffering costs required to solve that problem [76].…”

Section: Traffic Grooming Fragmentation and Split Spectrum Techniquesmentioning

confidence: 99%

Routing, Modulation and Spectrum Assignment Algorithm Using Multi-Path Routing and Best-Fit

et al. 2021

View full text Add to dashboard Cite

Elastic Optical Networks (EONs) are a promising optical technology to deal with the everincreasing traffic and the vast number of connected devices of the next generation of the Internet, associated to paradigms like the Internet of Things (IoT), the Tactile Internet or the Industry 4.0, to name just a few. In this kind of optical network, each optical circuit or lightpath is provisioned by means of superchannels of variable bandwidth. In this manner, only the necessary bandwidth to accommodate the demand is allocated, improving the spectrum usage. When establishing a connection, the EON control layer determines the modulation format to be used and allocates a portion of the spectrum in a sequence of fibers from the source to the destination node providing the user-demanded bandwidth. This is known as the routing, modulation level and spectrum assignment (RMSA) problem. In this work, we firstly review the most important contributions in that area, and then, we propose a novel RMSA algorithm, multi-path best-fit (MP-BF), which uses a split spectrum multi-path strategy together with a spectrum assignment technique (best-fit), and which jointly exploit the flexibility of EONs. A simulation study has been conducted comparing the performance of EONs when using MP-BF with other proposals from the literature. The results of this study show that, by using MP-BF, the network can increase its performance in terms of lightpath request blocking ratio and supported traffic load, without affecting the energy per bit or the computation time required to find a solution.

show abstract

A Resource-Periodic-Arrangement Strategy for RMSA Problem in Elastic Optical Networks

Liu¹,

Guo²,

Yuan³

et al. 2020

IEEE Access

View full text Add to dashboard Cite

Elastic optical networks (EONs), which can flexibly assign spectrum resources to connection requests, have become the most promising technology for the next generation of optical core networks. Routing, modulation and spectrum assignment (RMSA) problem is one of the key issues in elastic optical networks. In the RMSA problem, spectrum resources in links are generally divided into frequency slices and connection requests with different capacities can use different numbers of frequency slices to transfer their data; however, this may lead to misalignment of idle frequency slices in links and then result in the increase of blocking probability of connection requests. In this paper, we propose a resource-periodic-arrangement (RPA) strategy. The strategy partitions frequency slices into periodically arranged standard frequency blocks and each connection request exactly uses one or more standard frequency blocks. The RPA strategy can effectively reduce the misalignment of frequency slices. Furthermore, an RPA-based RMSA algorithm is designed, in which an enhanced-most-used policy is adopted to choose standard frequency blocks to connection requests. Simulation results show that the RPA-based RMSA algorithm can distinctly reduce blocking probability of connection requests, comparing with existing algorithms. INDEX TERMS Elastic optical networks (EONs), Routing Modulation and Spectrum Assignment (RMSA), Resource Periodic Arrangement (RPA), Enhanced Most Used (EMU)

show abstract

Dynamic Buffering Cost-Saving Multi-Path Routing under Differential Delay Constraint in EONs

Cited by 4 publications

References 4 publications

A Single–Multi-Path Combinatorial RMSA Algorithm with Least Resource Consumption in Semi-Filterless Optical Networks

A Single–Multi-Path Combinatorial RMSA Algorithm with Least Resource Consumption in Semi-Filterless Optical Networks

Routing, Modulation and Spectrum Assignment Algorithm Using Multi-Path Routing and Best-Fit

A Resource-Periodic-Arrangement Strategy for RMSA Problem in Elastic Optical Networks

Contact Info

Product

Resources

About