CFP last date
16 December 2024
Call for Paper
January Edition
IJAIS solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 16 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Ordered Frequent Itemsets Matrix Based On Fp-Tree Structure And Apriori Algorithm

Abdulkader M. Al-Badani Abdualmajed A. Al-Khulaidi
Random Articles
Reseach Article

Improved Extended Dijkstra�s Algorithm for Software Defined Networks

by Abdul-hafiz Abdulaziz, Emmanuel Adewale Adedokun, Sani Man-Yahya
journal cover thumbnail

International Journal of Applied Information Systems
Foundation of Computer Science (FCS), NY, USA
Volume 12 - Number 8
Year of Publication: 2017
Authors: Abdul-hafiz Abdulaziz, Emmanuel Adewale Adedokun, Sani Man-Yahya
10.5120/ijais2017451714

Abdul-hafiz Abdulaziz, Emmanuel Adewale Adedokun, Sani Man-Yahya . Improved Extended Dijkstra�s Algorithm for Software Defined Networks. International Journal of Applied Information Systems. 12, 8 ( Nov 2017), 22-26. DOI=10.5120/ijais2017451714

@article{ 10.5120/ijais2017451714,
author = { Abdul-hafiz Abdulaziz, Emmanuel Adewale Adedokun, Sani Man-Yahya },
title = { Improved Extended Dijkstra�s Algorithm for Software Defined Networks },
journal = { International Journal of Applied Information Systems },
issue_date = { Nov 2017 },
volume = { 12 },
number = { 8 },
month = { Nov },
year = { 2017 },
issn = { 2249-0868 },
pages = { 22-26 },
numpages = {9},
url = { https://www.ijais.org/archives/volume12/number8/1008-2017451714/ },
doi = { 10.5120/ijais2017451714 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2023-07-05T19:08:26.477648+05:30
%A Abdul-hafiz Abdulaziz
%A Emmanuel Adewale Adedokun
%A Sani Man-Yahya
%T Improved Extended Dijkstra�s Algorithm for Software Defined Networks
%J International Journal of Applied Information Systems
%@ 2249-0868
%V 12
%N 8
%P 22-26
%D 2017
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The existing Extended Dijkstra's algorithm for Software Defined Networks was developed to handle shortcomings associated with the traditional shortest path routing used in SDN. Today's SDN controllers route allocation mechanism is mainly based on Dijkstra algorithm. However, both approaches do not consider bandwidth utilization and do not take knowledge of the topology into consideration. This may result in network congestion and sub-optimal performance of applications. This paper presents a modified Extended Dijkstra's algorithm for Software Defined Networks using REST APIs and introduces a congestion control component responsible for handling traffic overhead in an SDN topology. The Abilene network topology was used to evaluate the performance of both approaches using throughput and latency as performance metrics.

References
  1. B. Wolfgang and M. Michael. 2014. Software-defined Networking: Using OpenFlow: Protocols, Applications and Architectural Design Choices. IEEE 13th International Conference on Trust, Security and Privacy in Computing Communications, 1-6.
  2. Dijkstra, E.W. 1959. A note on two problems in connexion with graphs, Numerishe mathematik 1 (1), 269-271.
  3. G. Deep and J. Hong. 2016. Round Robin Load Balancer using Software Defined Networking (SDN). Capstone Team Research Project, Vol. 5, 1-9, 2016.
  4. G. Senthil, and S. Rajani. 2015. Dynamic Load Balancing using Software Defined Networks. International Journal of Electrical and Computer Engineering (IJECE), Vol. 3, 203-256
  5. H. Tim. 2011. Path computation enhancement in Software Defined Networks. ChenDu College of University of Electronic Science and Technology.
  6. J. Jiang, H. Hsin-Wen, and C. Szu-Yuan. 2013. Extending Dijkstra’s shortest path algorithm for Software Defined Networks. Department of Computer Science and Information Engineering National Central University.
  7. K. Diego and M. Fernando. 2014. Software-Defined Networking: A Comprehensive Survey. International Conference on Advanced Information Networking and Applications, Vol. 103(1), 1-63.
  8. L.Hui, S.Yao, and T.Fin. 2013. Dynamic Load Balance Routing in OpenFlow Enabled Networks. IEEE International Conference on Advanced Information Networking and Applications, 290-297.
  9. Michael, D. 2011. The REST API Lifecycle: From Planning to Production. International Journal for Advances in Engineering Research, Vol. 2, 333-339.
  10. Mininet Website, http://mininet.org/, last accessed on May 2016.
  11. N. Handigol, M. Heller and M. Nick. 2013. Plug-n-Serve: Load-Balancing Web Traffic using OpenFlow. Networking Report, University of Washington, Vol. 7.
  12. N. Mckeown, T. Anderson. 2008. OpenFlow enabling innovation on campus networks. ACM SIGCOMM Computer Communication.
  13. Open Networking Foundation., OpenFlow Switch Specification version 1.4.0. Accessed on October 14, 2016
  14. OpenDaylight Developer Guide., OpenDaylight community. Accessed on October 14, 2015
  15. Y. Widhi, J. Jehn-Ruey, & B. Achmad. 2015. The Extended Dijkstra-based Load Balancing for OpenFlow Network. International Journal of Electrical and Computer Engineering (IJECE), Vol. 5(2)., 289-296
  16. Z. Khan, M.and Awais. 2014. Performance Evaluation of OpenDaylight SDN controller. Department of Computer Science, Namal College, Pakistan.
Index Terms

Computer Science
Information Sciences

Keywords

Software Defined Networking REST APIs Load Balancing Congestion Control

Powered by PhDFocusTM