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

07/01/2021
by   Yi-Zhi Xu, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/21/2022

Node-Type-Based Load-Balancing Routing for Parallel Generalized Fat-Trees

High-Performance Computing (HPC) clusters are made up of a variety of no...
research
11/28/2021

Improving the Resilience of Fast Failover Routing: TREE (Tree Routing to Extend Edge disjoint paths)

Today's communication networks have stringent availability requirements ...
research
03/17/2021

Real-Time Fault-Tolerance Node-to-Node Disjoint Paths Algorithm for Symmetric Networks

Disjoint paths are defined as paths between the source and destination n...
research
12/19/2017

The cavity approach for Steiner trees Packing problems

The Belief Propagation approximation, or cavity method, has been recentl...
research
03/08/2018

Self-healing Routing and Other Problems in Compact Memory

This paper looks at the question of designing distributed algorithms for...
research
04/15/2018

Forwarding and Optical Indices in an All-Optical BCube Network

BCube is a highly scalable and cost-effective networking topology, which...
research
01/17/2022

Fast and Heavy Disjoint Weighted Matchings for Demand-Aware Datacenter Topologies

Reconfigurable optical topologies promise to improve the performance in ...

Please sign up or login with your details

Forgot password? Click here to reset