Scalable Capacity Estimation for Nonlinear Elastic All-Optical Core Networks
Scalable Capacity Estimation for Nonlinear Elastic All-Optical Core Networks
复制标题
DOI：
10.1109/jlt.2019.2942710
复制
发表时间：
2019-11
影响因子：
4.7
通讯作者：
R. J. Vincent;D. Ives;S. Savory
中科院分区：
文献类型：
--
作者：
R. J. Vincent;D. Ives;S. Savory
路由和波长分配 (RWA) 算法必须在寻找具有高质量传输 (QoT) 的路由和寻找不会干扰分配未来流量的路由之间取得平衡。过分强调第一个因素将导致流量集中在主要路线上，从而导致拥塞，而过分强调第二个因素将导致各个收发器低于其能力运行，从而增加成本和功耗。本文提出了一种低复杂度算法，该算法表明，专注于波长打包可以实现更大的总体流量，同时仅对延迟和所需的收发器产生轻微的影响。对于相同的复杂性，我们的算法轻松优于 $k$SP–FF 路由，并且通常可以更好地改善拥塞感知路由，同时降低复杂性。我们在基于已部署拓扑的 4 个简化网络上展示了这些结果，然后将它们复制到基于德国和美国真实节点位置的 2,000 个人工生成的拓扑上。每个拓扑的容量是通过整数线性程序找到的，我们的算法与之比较，表明它提供了全局优化的可扩展替代方案。
Routing and wavelength assignment (RWA) algorithms must strike a balance between finding routes with high quality of transmission (QoT) and finding routes that will not interfere with allocating future traffic. Too much emphasis on the first will concentrate traffic along major routes causing congestion whilst too much emphasis on the second will cause individual transceivers to operate below their capabilities increasing both cost and power consumption. This paper presents a low–complexity algorithm that shows that focusing on wavelength packing allows for greater overall traffic whilst giving only slight penalties for latency and required transceivers. Our algorithm comfortably outperforms $k$SP–FF routing for the same complexity and typically betters congestion aware routing whilst reducing complexity. We show these results on 4 simplified networks based on deployed topologies before replicating them on 2,000 artificially generated topologies based on real node locations in Germany and the USA. Capacity for each topology was found with an integer linear program to which our algorithm compares favorably suggesting it provides a scalable alternative to global optimization.