Multicasting with the extended dijkstra’s shortest path algorithm forsoftware defined networking

Mahardeka Tri Ananta, Jehn Ruey Jiang, Muhammad Aziz Muslim

Research output: Contribution to journalArticlepeer-review

5 Scopus citations

Abstract

This work proposesa multicast algorithm on the basis of the extended Dijkstra’s shortest path algorithm for Software Defined Networking (SDN) to run on top of the controller. The proposed muticast algorithm is used to generate a multicast tree for a data publisher to deliver data packets to all subscribers so that every node and every host on the multicast tree will receive every packet once and at most once for reducing bandwidth consumption.The extended Dijkstra’s algorithm considers not only the edge weights, but also the node weights for a graph derived from the underlying SDN topology. We use Pyretic to implement a proposed algorithm over an SDN network, and compare itwith related ones under the Abilene network topology with the Mininet emulation tool. As shown by the comparisons, the proposed algorithm achieves the best performance in terms of throughput, jitter, and packet loss.

Original languageEnglish
Pages (from-to)21017-21030
Number of pages14
JournalInternational Journal of Applied Engineering Research
Volume9
Issue number23
StatePublished - 2014

Keywords

  • Multicast
  • Network topology
  • Software Defined Networking (SDN)

Fingerprint

Dive into the research topics of 'Multicasting with the extended dijkstra’s shortest path algorithm forsoftware defined networking'. Together they form a unique fingerprint.

Cite this