论文标题

空间渠道网络(SCNS)中的多层路由和资源分配:朝向庞大的SDM时代

Multilayer Routing and Resource Assignment in Spatial Channel Networks (SCNs): Oriented Toward the Massive SDM Era

论文作者

Yang, Mingcong, Wu, Qian, Shigeno, Maiko, YongbingZhang

论文摘要

在过去的几十年中,光学传输网络(OTN)经历了显着的演变,从最早的波长划分多路复用(WDM)OTN到弹性光学网络(EON),再到后来的太空划分多路复用(SDM)OTN,以解决互联网流量的连续增长。到2024年,预计PBPS级OTN远远超过了单模纤维的容量极限。大规模的SDM时代即将到来。在这种情况下,最近提出了新设计的称为“空间通道网络”(SCN)的OTN,该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.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源