Adapted and constrained Dijkstra for elastic optical networks

04/15/2019
by   Ireneusz Szcześniak, et al.
0

We present an optimal and efficient algorithm for finding a shortest path in an elastic optical network. The algorithm is an adaptation of the Dijkstra shortest path algorithm, where we take into account the spectrum continuity and contiguity constraints, and a limit on the path length. The adaptation redefines the node label in the Dijkstra algorithm, allows for revisiting nodes even at a higher cost for different slices, avoids loops, and prunes worse labels. The algorithm is generic and agnostic of a specific spectrum allocation policy, as it finds the largest set of available slices from which slices can be allocated in any way. We describe and motivate the algorithm design, and point to our freely-available implementation using the Boost Graph Library. We carried out 8100 simulation runs for large, random and realistic networks, and found that the probability of establishing a connection using the proposed algorithm can be even twice as large as the probability of establishing a connection using the edge-disjoint shortest paths, and the Yen K shortest paths.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/10/2018

Generic Dijkstra for Optical Networks

We present the generic Dijkstra shortest path algorithm: an efficient al...
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
02/17/2021

A Vectored Fragmentation Metric for Elastic Optical Networks

When circuits are set up and dismantled dynamically in elastic optical n...
research
03/15/2023

Shortest Paths in Portalgons

Any surface that is intrinsically polyhedral can be represented by a col...
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
04/08/2022

Finding shortest and nearly shortest path nodes in large substantially incomplete networks

Dynamic processes on networks, be it information transfer in the Interne...
research
03/07/2019

Using DP Towards A Shortest Path Problem-Related Application

The detection of curved lanes is still challenging for autonomous drivin...

Please sign up or login with your details

Forgot password? Click here to reset