arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2107.00609physics.soc-phcond-mat.dis-nncond-mat.stat-mechcs.NIeess.SP
收藏

可扩展的节点不相交和边缘不相交多波长路由

Scalable Node-Disjoint and Edge-Disjoint Multi-wavelength Routing

Yi-Zhi Xu, Ho Fai Po, Chi Ho Yeung, David Saad

摘要:

概率消息传递算法被开发用于在多波长光通信网络中,在节点和边缘不相交的路由约束下以及对于各种目标函数的路由传输。全局路由优化本身是一个很难的计算任务,但在节点/边缘不相交的约束下,并在存在多个波长,一个问题,占主导地位的路由效率在真正的光通信网络,承载世界上大部分的互联网业务的情况下,变得更加困难。我们已经开发的可扩展的原则性方法是准确的树,但提供了良好的近似解决方案,局部树状图。它适应各种目标函数,对应于低延迟,负载平衡和路由整合,并且可以很容易地扩展到包括边缘上的异构信噪比值和对每个边缘的可用波长的限制。它可用于路由和管理现有拓扑上的传输,以及用于设计和修改光通信网络。此外,它还提供了一种工具来解决关于波长交换节点的优点及其提供的附加功能的一个悬而未决且备受争议的问题。该方法已被测试生成的网络,如随机规则,Erdés Rényi和幂律图,以及在英国和美国的光通信网络。他们表现出优异的性能与现有的方法在小型网络上,并已扩大到网络规模,是超出了现有的大多数算法。

英文摘要:

Probabilistic message-passing algorithms are developed for routing transmissions in multi-wavelength optical communication networks, under node and edge-disjoint routing constraints and for various objective functions. Global routing optimization is a hard computational task on its own but is made much more difficult under the node/edge-disjoint constraints and in the presence of multiple wavelengths, a problem which dominates routing efficiency in real optical communication networks that carry most of the world's Internet traffic. The scalable principled method we have developed is exact on trees but provides good approximate solutions on locally tree-like graphs. It accommodates a variety of objective functions that correspond to low latency, load balancing and consolidation of routes, and can be easily extended to include heterogeneous signal-to-noise values on edges and a restriction on the available wavelengths per edge. It can be used for routing and managing transmissions on existing topologies as well as for designing and modifying optical communication networks. Additionally, it provides the tool for settling an open and much debated question on the merit of wavelength-switching nodes and the added capabilities they provide. The methods have been tested on generated networks such as random-regular, Erdős Rényi and power-law graphs, as well as on the UK and US optical communication networks. They show excellent performance with respect to existing methodology on small networks and have been scaled up to network sizes that are beyond the reach of most existing algorithms.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑