4.7 Article

Scalable node-disjoint and edge-disjoint multiwavelength routing

Journal

PHYSICAL REVIEW E
Volume 105, Issue 4, Pages -

Publisher

AMER PHYSICAL SOC
DOI: 10.1103/PhysRevE.105.044316

Keywords

-

Funding

  1. Engineering and Physical Sciences Research Council (EPSRC) Programme Grant TRANSNET [EP/R035342/1]
  2. Research Grants Council of the Hong Kong Special Administrative Region, China [EdUHK GRF 18304316, 18301217, GRF 18301119]
  3. Dean's Research Fund of the Faculty of Liberal Arts and Social Sciences [FLASS/DRF 04418, FLASS/ROP 04396, FLASS/DRF 04624]
  4. Internal Research Grant [RG67 2018-2019R R4015, RG31 2020-2021R R4152]
  5. Education University of Hong Kong, Hong Kong Special Administrative Region, China

Ask authors/readers for more resources

Probabilistic message-passing algorithms are developed to address the routing transmissions problem in multiwavelength optical communication networks. The method provides good approximate solutions on locally treelike graphs and accommodates various objective functions. It can be used for managing and designing optical communication networks and settles the debate on the merit of wavelength-switching nodes.
Probabilistic message-passing algorithms are developed for routing transmissions in multiwavelength 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- and 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 treelike 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 wavelengthswitching nodes and the added capabilities they provide. The methods have been tested on generated networks such as random-regular, Erdo??s R??nyi, and power-law graphs, as well as on optical communication networks in the United Kingdom and United States. 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.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available