空间信道网络（SCN）中的多层路由与资源分配：面向大规模SDM时代
Multilayer Routing and Resource Assignment in Spatial Channel Networks (SCNs): Oriented Toward the Massive SDM Era
AI总结：
本文面向大规模SDM时代定义SCN中的路由、空间信道与频谱分配（RSCSA）问题，并提出ILP模型与启发式算法，验证其可获得最优或近下界解。
摘要：
在过去几十年中，光传送网（OTN）经历了显著演进，从最早的波分复用（WDM）OTN到弹性光网络（EON），再到后来的空分复用（SDM）OTN，以应对互联网流量的持续增长。到2024年，预计将出现Pbps级OTN，其容量远远超过单模光纤的容量极限。大规模SDM时代即将到来。在这一背景下，最近有人提出了名为空间信道网络（SCN）的新型OTN，它通过实用的分级光交叉连接实现高成本效率。然而，OTN的演进同时也会带来与网络中资源分配相关的挑战。例如，随着从WDM-OTN演进到EON，由于额外引入了频谱连续性约束，资源分配问题从路由与波长分配（RWA）问题转变为路由与频谱分配（RSA）问题。同样，专门设计的算法对于解决SCN中的资源分配问题也被认为至关重要。本文将这一新问题定义为路由、空间信道与频谱分配（RSCSA）问题。我们提出了一个整数线性规划（ILP）模型和一种启发式算法来求解RSCSA问题。我们通过仿真实验考察了所提方法的性能。结果表明，所提出的两种方法都能有效地找到最优解或接近下界的解。据我们所知，这是首个聚焦SCN中资源分配问题的研究工作。
英文摘要：
In the past few decades, optical transport networks (OTNs) have undergone significant evolution, from the earliest wavelength-division multiplexing (WDM) OTNs to elastic optical networks (EONs) and later to space-division multiplexing (SDM) OTNs, to address the continuous growth of Internet traffic. By 2024, Pbps-level OTNs are expected, far exceeding the capacity limit of single-mode fibers. The massive SDM era is on the horizon. In this context, newly designed OTNs called spatial channel networks (SCNs), which achieve high cost efficiency by means of practical hierarchical optical cross-connects, have recently been proposed. However, the evolution of OTNs will simultaneously present challenges related to resource allocation in networking. For instance, with the evolution from WDM-OTNs to EONs, the resource allocation problem was transformed from the routing and wavelength assignment (RWA) problem to 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 resource allocation 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 problem of resource allocation in SCNs.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
