Routing and Spectrum Allocation in Spectrum-Sliced Elastic Optical Path Networks: A Primal-Dual Framework
The recent decade has witnessed a tremendous growth of Internet traffic, which is expected to continue climbing for the foreseeable future. As a new paradigm, Spectrum-sliced Elastic Optical Path (SLICE) networks promise abundant (elastic) bandwidth to address the traffic explosion, while bearing ot...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2021-11-01
|
| Series: | Electronics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2079-9292/10/22/2809 |
| _version_ | 1797510532641587200 |
|---|---|
| author | Yang Wang Chaoyang Li Qian Hu Jabree Flor Maryam Jalalitabar |
| author_facet | Yang Wang Chaoyang Li Qian Hu Jabree Flor Maryam Jalalitabar |
| author_sort | Yang Wang |
| collection | DOAJ |
| description | The recent decade has witnessed a tremendous growth of Internet traffic, which is expected to continue climbing for the foreseeable future. As a new paradigm, Spectrum-sliced Elastic Optical Path (SLICE) networks promise abundant (elastic) bandwidth to address the traffic explosion, while bearing other inherent advantages including enhanced signal quality and extended reachability. The fundamental problem in SLICE networks is to route each traffic demand along a lightpath with continuously and consecutively available sub-carriers, which is known as the Routing and Spectrum Allocation (RSA) problem. Given its NP-Hardness, the solutions to the RSA problem can be classified into two categories: optimal solutions using link-based, path-based, and channel-based Integer Linear Programming (ILP) models, which require extensive computational time; and sub-optimal heuristic and meta-heuristic algorithms, which have no guarantee on the solution quality. In this work, inspired by a channel-based ILP model, we propose a novel primal-dual framework to address the RSA problem, which can obtain a near-optimal solution with guaranteed per-instance closeness to the optimal solution. |
| first_indexed | 2024-03-10T05:33:34Z |
| format | Article |
| id | doaj.art-b24a8a0301b94ff9827aa8217ccac772 |
| institution | Directory Open Access Journal |
| issn | 2079-9292 |
| language | English |
| last_indexed | 2024-03-10T05:33:34Z |
| publishDate | 2021-11-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Electronics |
| spelling | doaj.art-b24a8a0301b94ff9827aa8217ccac7722023-11-22T23:07:26ZengMDPI AGElectronics2079-92922021-11-011022280910.3390/electronics10222809Routing and Spectrum Allocation in Spectrum-Sliced Elastic Optical Path Networks: A Primal-Dual FrameworkYang Wang0Chaoyang Li1Qian Hu2Jabree Flor3Maryam Jalalitabar4Department of Math and Computer Science, La Salle University, Philadelphia, PA 19141, USASchool of Computer Science and Engineering, Huizhou University, Huizhou 516007, ChinaDepartment of Math and Computer Science, La Salle University, Philadelphia, PA 19141, USADepartment of Math and Computer Science, La Salle University, Philadelphia, PA 19141, USADepartment of Computer Science, California State University, Northridge, Los Angeles, CA 91330, USAThe recent decade has witnessed a tremendous growth of Internet traffic, which is expected to continue climbing for the foreseeable future. As a new paradigm, Spectrum-sliced Elastic Optical Path (SLICE) networks promise abundant (elastic) bandwidth to address the traffic explosion, while bearing other inherent advantages including enhanced signal quality and extended reachability. The fundamental problem in SLICE networks is to route each traffic demand along a lightpath with continuously and consecutively available sub-carriers, which is known as the Routing and Spectrum Allocation (RSA) problem. Given its NP-Hardness, the solutions to the RSA problem can be classified into two categories: optimal solutions using link-based, path-based, and channel-based Integer Linear Programming (ILP) models, which require extensive computational time; and sub-optimal heuristic and meta-heuristic algorithms, which have no guarantee on the solution quality. In this work, inspired by a channel-based ILP model, we propose a novel primal-dual framework to address the RSA problem, which can obtain a near-optimal solution with guaranteed per-instance closeness to the optimal solution.https://www.mdpi.com/2079-9292/10/22/2809RSASLICEdecomposition |
| spellingShingle | Yang Wang Chaoyang Li Qian Hu Jabree Flor Maryam Jalalitabar Routing and Spectrum Allocation in Spectrum-Sliced Elastic Optical Path Networks: A Primal-Dual Framework Electronics RSA SLICE decomposition |
| title | Routing and Spectrum Allocation in Spectrum-Sliced Elastic Optical Path Networks: A Primal-Dual Framework |
| title_full | Routing and Spectrum Allocation in Spectrum-Sliced Elastic Optical Path Networks: A Primal-Dual Framework |
| title_fullStr | Routing and Spectrum Allocation in Spectrum-Sliced Elastic Optical Path Networks: A Primal-Dual Framework |
| title_full_unstemmed | Routing and Spectrum Allocation in Spectrum-Sliced Elastic Optical Path Networks: A Primal-Dual Framework |
| title_short | Routing and Spectrum Allocation in Spectrum-Sliced Elastic Optical Path Networks: A Primal-Dual Framework |
| title_sort | routing and spectrum allocation in spectrum sliced elastic optical path networks a primal dual framework |
| topic | RSA SLICE decomposition |
| url | https://www.mdpi.com/2079-9292/10/22/2809 |
| work_keys_str_mv | AT yangwang routingandspectrumallocationinspectrumslicedelasticopticalpathnetworksaprimaldualframework AT chaoyangli routingandspectrumallocationinspectrumslicedelasticopticalpathnetworksaprimaldualframework AT qianhu routingandspectrumallocationinspectrumslicedelasticopticalpathnetworksaprimaldualframework AT jabreeflor routingandspectrumallocationinspectrumslicedelasticopticalpathnetworksaprimaldualframework AT maryamjalalitabar routingandspectrumallocationinspectrumslicedelasticopticalpathnetworksaprimaldualframework |