The Extended Dijkstra’s-based Load Balancing for OpenFlow Network

Widhi Yahya, Achmad Basuki, Jehn Ruey Jiang


This paper proposes load-balancing algorithm on the basis of the Extended Dijkstra’s shortest path algorithm for Software Defined Networking (SDN). The Extended Dijkstra’s algorithm considers not only the edge weights, but also the node weights to find the nearest server for a requesting client. The proposed algorithm also considers the link load in order to avoid congestion. We use Pyretic to implement the proposed algorithm and compare it with related ones under the Abilene network topology with the Mininet emulation tool. As shown by the comparisons, the proposed algorithm outperforms the others in term of the network end-to-end latency, throughput and response time at the expense of a little heavier computation load and more memory usage on the SDN controller.


software defined networking (SDN); load-balancing; shortest path; Dijkstra’s algorithm

Full Text:



Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

International Journal of Electrical and Computer Engineering (IJECE)
p-ISSN 2088-8708, e-ISSN 2722-2578

This journal is published by the Institute of Advanced Engineering and Science (IAES) in collaboration with Intelektual Pustaka Media Utama (IPMU).