Generic Dijkstra for Optical Networks

10/10/2018
by   Ireneusz Szcześniak, et al.
0

We present the generic Dijkstra shortest path algorithm: an efficient algorithm for finding a shortest path in an optical network, both in a wavelength-division multiplexed network, and an elastic optical network. Our algorithm is an enabler of the real-time softwarized control of large-scale networks, and not only optical, we believe. The Dijkstra algorithm is a generalization of the depth-first search, and we generalize the Dijkstra algorithm further to resolve the continuity and contiguity constraints of the frequency slot units. Specifically, we generalize the notion of a label, change what we iterate with, and reformulate the edge relaxation so that vertices are revisited, loops avoided, and worse labels discarded. We also used the typical constriction during edge relaxation to take care of the signal modulation constraints. The algorithm can be used with various spectrum allocation policies. We motivate and discuss the algorithm design, and provide our libre, high-quality, and generic implementation using the Boost Graph Library. We carried out 85000 simulation runs for realistic and random networks (Gabriel graphs) of 75 vertices with about a billion shortest-path searches, and found that the proposed algorithm outperforms considerably other three competing optimal algorithms, which are frequently used in research.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/15/2019

Adapted and constrained Dijkstra for elastic optical networks

We present an optimal and efficient algorithm for finding a shortest pat...
research
05/11/2019

The efficient and optimal algorithm for the dynamic dedicated path protection

We present the efficient and optimal algorithm for dynamic routing with ...
research
06/10/2020

Empirical Time Complexity of Generic Dijkstra Algorithm

Generic Dijkstra is a novel algorithm for finding the optimal shortest p...
research
09/10/2019

Resource allocation using SPA based on different cost functions in elastic optical networks

Routing, modulation and spectrum allocation in elastic optical networks ...
research
03/28/2019

More Parallelism in Dijkstra's Single-Source Shortest Path Algorithm

Dijkstra's algorithm for the Single-Source Shortest Path (SSSP) problem ...
research
04/28/2022

Generic Dijkstra: correctness and tractability

The recently-proposed generic Dijkstra algorithm finds shortest paths in...
research
11/03/2013

An Adaptive Amoeba Algorithm for Shortest Path Tree Computation in Dynamic Graphs

This paper presents an adaptive amoeba algorithm to address the shortest...

Please sign up or login with your details

Forgot password? Click here to reset