Generic Dijkstra for optical networks

  title={Generic Dijkstra for optical networks},
  author={Ireneusz Szczesniak and Andrzej Jajszczyk and Bożena Woźna-Szcześniak},
  journal={IEEE/OSA Journal of Optical Communications and Networking},
We present the generic Dijkstra shortest-path algorithm: an efficient algorithm for finding a shortest path in an optical network, in both a wavelength-division multiplexed network and an elastic optical network (EON. [] Key Method The Dijkstra algorithm is a generalization of the breadth-first search, and we generalize the Dijkstra algorithm further to resolve the continuity and contiguity constraints of the frequency slot units required in EONs.

Figures and Tables from this paper

Empirical Time Complexity of Generic Dijkstra Algorithm
It is discovered that the running time of the Generic Dijkstra algorithm in the function of network utilization is not monotonic, as peak running time is at approximately 0.25 network utilization.
The efficient and optimal algorithm for the dynamic dedicated path protection
The efficient and optimal algorithm for dynamic routing with dedicated path protection in optical networks is presented, which uses the generic Dijkstra algorithm on a search graph generated ``on-the-fly'' based on the input graph.
Generic Dijkstra: correctness and tractability
To prove the algorithm correct, the Bellman’s principle of optimality is generalized, and it is argued the stated problem is tractable by analyzing the size of the search space in the worst-case.
Towards an Efficient and Exact Algorithm for Dynamic Dedicated Path Protection
A novel algorithm for dynamic routing with dedicated path protection with signal modulation constraints for elastic optical networks of 25, 50, and 100 nodes, and with 160, 320, and 640 spectrum units is presented.
Path Computation for Dynamic Provisioning in Multi-Technology Multi-Layer Transport Networks
A new mechanism for building an auxiliary graph that models each layer as a node within each network element and creates adaptation edges between them and also supports creation of special edges to represent different types of topologies, is proposed.
A wave time-varying neural network for solving the time-varying shortest path problem
The proposed wave time-varying neural network (WTNN) can arrive at the global optimal solution of three TSPP variant problems with different waiting polices and outperforms existing algorithms.
Big Data Processing on Volunteer Computing
Voluntary computing can be applied to the processing of big data, which has a good reference significance for the distributed analysis of large-scale complex networks.
A Survey of Recent Applications of Improved Dijkstra’s Shortest Path Algorithm
A survey of improved algorithms based on Dijkstra’s algorithm that are applied in different application areas is presented.
A Dynamic Planning Algorithm based on Q-Learning Routing in SDON
An adaptive routing algorithm based on Q-learning in the SDON controller is introduced, which effectively realizes dynamic load balancing and reduces the risk of congestion in the optical transmission network.


Adapted and constrained Dijkstra for elastic optical networks
  • I. Szczesniak, B. Wozna
  • Computer Science
    2016 International Conference on Optical Network Design and Modeling (ONDM)
  • 2016
An optimal and efficient algorithm for finding a shortest path in an elastic optical network that 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.
Modeling the routing and spectrum allocation problem for flexgrid optical networks
This study addresses an off-line RSA problem in which enough spectrum needs to be allocated for each demand of a given traffic matrix and presents novel integer lineal programming (ILP) formulations of RSA that are based on the assignment of channels.
Improved dynamic routing algorithms in elastic optical networks
  • I. Olszewski
  • Computer Science
    Photonic Network Communications
  • 2017
The considered Routing, Modulation Level and Spectrum Allocation (RMLSA) problem covers path length minimization while still meeting the spectrum continuity constraints, non-overlapping spectra
Dynamic routing and spectrum assignment in spectrum-flexible transparent optical networks
This work introduces a decomposition approach that divides the nonlinear problem into three steps: selecting the modulation format, solving the linear basic RSA problem, and checking the transmission distances, and proves that, in theory, the modulation level adaptive RSA approach can find the optimal solution to the complete RSA problem.
Routing and Spectrum Allocation in Elastic Optical Networks: A Tutorial
A tutorial that covers the key aspects of elastic optical networks, and explores the experimental demonstrations that have tested the functionality of the elastic optical network, along with the research challenges and open issues posed by flexible networks.
A Review of Routing and Wavelength Assignment Approaches for Wavelength- Routed Optical WDM Networks
This study focuses on the routing and WavelengthAssignment (RWA) problem in wavelength-routed optical WDM networks. Most of the attention is devoted to such networks operating under the
Indirect and Direct Multicost Algorithms for Online Impairment-Aware RWA
Two multicost algorithms are presented that account for the actual current interference among lightpaths, as well as for other physical effects, performing a cross-layer optimization between the network and physical layers.
A study of the routing and spectrum allocation in spectrum-sliced Elastic Optical Path networks
This work comprehensively study the routing and spectrum allocation (RSA) problem in the SLICE network, and formulate the RSA problem using the Integer Linear Programming (ILP) formulations to optimally minimize the maximum number of sub-carriers required on any fiber of a SLice network.
Dynamic routing and spectrum allocation in elastic optical networks with mixed line rates
Simulation results prove that the proposedynamic RSA algorithms are time efficient and perform better than existing dynamic RSA algorithms in terms of bandwidth blocking probability and spectrum fragmentation ratio in EONs with mixed line rates.
Distance-adaptive spectrum resource allocation in spectrum-sliced elastic optical path network [Topics in Optical Communications]
A concept of a novel adaptation scheme in SLICE called distance-adaptive spectrum resource allocation, which can save more than 45 percent of required spectrum resources for a 12-node ring network, is presented.