Melola Discovery

← Melola Discovery

Open access Jurnal SINTA 1

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

International Journal of Electrical and Computer Engineering (IJECE) · Vol. 5 No. 2 (2015)

DOI
10.11591/ijece.v5i2.pp289-296
ISSN
2088-8708, 2088-8708
Published
2015-04-01
Publisher
Institute of Advanced Engineering and Science
License
creativecommons.org/licenses/by-nc/4.0

Abstract

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.

Collaboration network of the authors

23 authors · 38 co-authorship links · 6 across different organisations

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • University of Brawijaya
  • National Central University
  • Politeknik Elektronika Negeri Surabaya
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Sabriansyah Rizqika AkbarUniversity of Brawijaya2
Fitra Abdurrachman BachtiarUniversity of Brawijaya2
Eko SetiawanUniversity of Brawijaya2
Adhitya BhawiyugaUniversity of Brawijaya2
Barlian HenryranuUniversity of Brawijaya1
Maystia Tri HandonoAffiliation unknown1
Fandisya RahmanUniversity of Brawijaya1
Ismiarta AknurandaUniversity of Brawijaya1
Bayu SutawijayaUniversity of Brawijaya1
Khafidzun FadliUniversity of Brawijaya1
Sulandri SulandriUniversity of Brawijaya1
Muhammad Jainal ArifinPoliteknik Elektronika Negeri Surabaya1
Bima Sena Bayu DewantaraPoliteknik Elektronika Negeri Surabaya1
Hawwin Purnama AkbarUniversity of Brawijaya1
Muhammad Naufal DzakieUniversity of Brawijaya1
Kasyful AmronUniversity of Brawijaya1
Primantara Hari TrisnawanUniversity of Brawijaya1
Maystya Tri HandonoUniversity of Brawijaya1
Lutfi FananiUniversity of Brawijaya1
Deron LiangNational Central University1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

This record comes from Crossref (what the publisher deposited), because the journal's own OAI-PMH endpoint could not be harvested.

Metadata source: Crossref API (cadangan, berdasarkan ISSN) https://api.crossref.org/journals/2088-8708/works, first harvested 27 Okt 2026, last seen 27 Okt 2026.
Metadata as oai_dc, converted from Crossref
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"><dc:title>The Extended Dijkstra’s-based Load Balancing for OpenFlow Network</dc:title><dc:creator>Yahya, Widhi</dc:creator><dc:creator>Basuki, Achmad</dc:creator><dc:creator>Jiang, Jehn Ruey</dc:creator><dc:description>&lt;jats:p&gt;&amp;lt;span lang="EN-US"&amp;gt;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.&amp;lt;/span&amp;gt;&lt;/jats:p&gt;</dc:description><dc:publisher>Institute of Advanced Engineering and Science</dc:publisher><dc:date>2015-04-01</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://doi.org/10.11591/ijece.v5i2.pp289-296</dc:identifier><dc:identifier>10.11591/ijece.v5i2.pp289-296</dc:identifier><dc:source>International Journal of Electrical and Computer Engineering (IJECE); Vol 5 No 2 (2015); 289</dc:source><dc:source>2088-8708</dc:source><dc:source>2088-8708</dc:source><dc:relation>http://ijece.iaescore.com/index.php/IJECE/article/viewFile/5696/4755</dc:relation><dc:rights>http://creativecommons.org/licenses/by-nc/4.0</dc:rights></oai_dc:dc>