Hierarchical Routing and Resource Assignment in Spatial Channel Networks (SCNs): Oriented Toward the Massive SDM Era
| Autor: | Qian Wu, Maiko Shigeno, Mingcong Yang, Yongbing Zhang |
|---|---|
| Rok vydání: | 2021 |
| Předmět: | |
| Zdroj: | Journal of Lightwave Technology. 39:1255-1270 |
| ISSN: | 1558-2213 0733-8724 |
| DOI: | 10.1109/jlt.2020.3035418 |
| Popis: | In the past few decades, the architecture of optical networks has undergone significant evolution, from the earliest wavelength-division multiplexing (WDM) optical networks to elastic optical networks (EONs) and later to space-division multiplexing (SDM) EONs, to address the continuous growth of Internet traffic. By 2024, Pbps-level optical networks are expected, far exceeding the capacity limit of single-mode fibers. The massive SDM era is on the horizon. In this context, a newly designed architecture for optical networks called the spatial channel network (SCN) architecture, which achieves high cost efficiency by means of practical hierarchical optical cross-connects, has recently been proposed. However, the evolution of optical network architectures will simultaneously present challenges related to network optimization. For instance, with the evolution from WDM optical networks to EONs, the kernel network optimization problem was transformed from the routing and wavelength assignment (RWA) problem into the routing and spectrum assignment (RSA) problem due to the additionally introduced constraint of spectrum contiguity. Similarly, specially designed algorithms are also expected to be essential for addressing the network optimization problem in SCNs. In this paper, we define this new problem as the routing, spatial channel, and spectrum assignment (RSCSA) problem. We propose an integer linear programming (ILP) model and a heuristic algorithm to solve the RSCSA problem. We examine the performance of the proposed approaches via simulation experiments. The results show that both proposed approaches are effective in finding the optimal solutions or solutions close to the lower bounds. To the best of our knowledge, this is the first work to focus on the network optimization problem in SCNs. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|