Open AccessModified Dijkstra Shortest Path Algorithm for SD Networks
Author(s) -
Haitham M. Abdelghany,
Fayez W. Zaki,
Mohamed Ashour
Publication year - 2022
Publication title -
international journal of electrical and computer engineering systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.141
H-Index - 4
eISSN - 1847-7003
pISSN - 1847-6996
DOI - 10.32985/ijeces.13.3.5
Subject(s) - dijkstra's algorithm , jitter , computer science , shortest path problem , algorithm , path (computing) , cumulative distribution function , k shortest path routing , bandwidth (computing) , real time computing , mathematics , theoretical computer science , computer network , probability density function , statistics , telecommunications , graph
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.