Original scientific paper

https://doi.org/10.32985/ijeces.13.3.5

Modified Dijkstra Shortest Path Algorithm for SD Networks

Haitham M. Abdelghany orcid.org/0000-0002-6664-8139 ; Electronics and Communication Engineering Department, Faculty of Engineering, Mansoura University, El-Mansoura, Egypt
Fayez W. Zaki ; Electronics and Communication Engineering Department, Faculty of Engineering, Mansoura University, El-Mansoura, Egypt
Mohammed M. Ashour orcid.org/0000-0002-0294-0552 ; Electronics and Communication Engineering Department, Faculty of Engineering, Mansoura University, El-Mansoura, Egypt

Abstract

This paper uses a modified Dijkstra shortest path method for considering cumulative delays rather than bandwidth in software-defined networks. To implement the proposed method, an open-source Ryu controller is used, and a Mininet tool is used to emulate the topology. The proposed method is compared with the traditional Dijkstra’s algorithm to demonstrate its performance. This comparison shows that the modified Dijkstra’s algorithm provides higher performance of the different cumulative delays. Several experiments were conducted to evaluate the performance of the proposed method using three parameters (bandwidth, transfer rate and jitter). In addition, the cumulative distribution function is calculated using the parameters to show its distribution through the experiment period.

Keywords

Dijkstra shortest path; Software-Defined Networking; Ryu; Mininet; Jitter; cumulative distribution function

Hrčak ID:

277937

URI

https://hrcak.srce.hr/277937

Publication date:

19.4.2022.

Visits: 1.114 *