IDEAS home Printed from https://ideas.repec.org/a/gvu/iroei0/v5y2023i4id534.html

Shortest Path Routing Performance Evaluation over SDN Environment

Author

Listed:
  • Roshani Ghimire
  • Ram Kumar Basnet

Abstract

Static routing has a manual configuration setup system, and the scope of static routing in an SDN network is just for small networks. The solution to this problem rises up with the new technology defined as software-defined networking (SDN) based on shortest path first dynamic routing. SDN has the facility of a centralized controller that smooth the controls and routes computation over a data packet. The performance analysis of SDN networks that have SDN switches connected to the network based on the shortest path first protocol are simulated on Mininet. The POX controller with Mininet programming feature for creating smart topologies was chosen. In this research, the SDN network using Dijkstra’s algorithm, Bellman-Ford algorithm, extended Dijkstra’s algorithm and Floyd Warshall Algorithm were implemented. The quality factors of SDN created by using four algorithms are measured in terms of delay, jitter, latency, packet loss, transmit, received, throughput, and bandwidth based on experimental results and European Telecommunications Standards Institute (ETSI) data. The performance parameters of SDN network topology created using Dijkstra’s, bellman ford, extended Dijkstra’s, and Floyd Warshall algorithms were compared and the experimental results showed that Bellman-Ford algorithm is better in terms of performance parameters than the other three algorithms.

Suggested Citation

Handle: RePEc:gvu:iroei0:v:5:y:2023:i:4:id:534
DOI: 10.36548/jei.2023.4.004
as

Download full text from publisher

File URL: https://irojournals.com/iroei/article/view/534
File Function: Abstract page
Download Restriction: no

File URL: https://irojournals.com/iroei/article/download/534/471
File Function: Full text
Download Restriction: no

File URL: https://libkey.io/10.36548/jei.2023.4.004?utm_source=ideas
LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
---><---

More about this item

Keywords

;
;
;

Statistics

Access and download statistics

Corrections

All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gvu:iroei0:v:5:y:2023:i:4:id:534. See general information about how to correct material in RePEc.

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

We have no bibliographic references for this item. You can help adding them by using this form .

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Manager (email available below). General contact details of provider: https://irojournals.com/iroei .

Please note that corrections may take a couple of weeks to filter through the various RePEc services.

IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.