Load balancing and multicasting using the extended Dijkstra's algorithm in software defined networking

Jehn Ruey Jiang, Widhi Yahya, Mahardeka Tri Ananta

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

6 Scopus citations

Abstract

The extended Dijkstra's algorithm considers not only the edge weights but also the node weights for finding shortest paths from a source node to all other nodes in a given graph. To show the advantage of the extended Dijkstra's algorithm, this paper proposes a load-balancing algorithm and a multicast algorithm in Software Defined Networking (SDN) on the basis of the extended Dijkstra's algorithm for a graph derived from the underlying SDN topology. We use Pyretic to implement the proposed algorithms and compare them with related ones under the Abilene network topology with the Mininet emulation tool. As shown by the comparisons, the proposed algorithms outperform basic algorithms.

Original languageEnglish
Title of host publicationIntelligent Systems and Applications - Proceedings of the International Computer Symposium, ICS 2014
EditorsWilliam Cheng-Chung Chu, Stephen Jenn-Hwa Yang, Han-Chieh Chao
PublisherIOS Press
Pages2123-2132
Number of pages10
ISBN (Electronic)9781614994831
DOIs
StatePublished - 2015
EventInternational Computer Symposium, ICS 2014 - Taichung, Taiwan
Duration: 12 Dec 201414 Dec 2014

Publication series

NameFrontiers in Artificial Intelligence and Applications
Volume274
ISSN (Print)0922-6389

Conference

ConferenceInternational Computer Symposium, ICS 2014
Country/TerritoryTaiwan
CityTaichung
Period12/12/1414/12/14

Keywords

  • Dijkstra's algorithm
  • load-balancing
  • multicasting
  • shortest path
  • Software Defined Networking (SDN)

Fingerprint

Dive into the research topics of 'Load balancing and multicasting using the extended Dijkstra's algorithm in software defined networking'. Together they form a unique fingerprint.

Cite this