IMPLEMENTATION OF JOHNSON'S SHORTEST PATH ALGORITHM FOR ROUTE DISCOVERY MECHANISM ON SOFTWARE DEFINED NETWORK

Authors

  • Akbar Pandu Segara Institut Teknologi Sepuluh Nopember Surabaya
  • Royyana Muslim Ijtihadie Institut Teknologi Sepuluh Nopember Surabaya
  • Tohari Ahmad Institut Teknologi Sepuluh Nopember Surabaya
Views: 403 Downloads: 284 DOI: https://doi.org/10.12962/j24068535.v19i1.a1011

Abstract

Software Defined Network is a network architecture with a new paradigm which consists of a control plane that is placed separately from the data plane. All forms of computer network behavior are controlled by the control plane. Meanwhile the data plane consisting of a router or switch becomes a device for packet forwarding. With a centralized control plane model, SDN is very vulnerable to congestion because of the one-to-many communication model. There are several mechanisms for congestion control on SDNs, one of which is modifying packets by reducing the size of packets sent. But this is considered less effective because the time required will be longer because the number of packets sent is less. This requires that network administrators must be able to configure a network with certain routing protocols and algorithms. Johnson's algorithm is used in determining the route for packet forwarding, with the nature of the all-pair shortest path that can be applied to SDN to determine through which route the packet will be forwarded by comparing all nodes that are on the network. The results of the Johnson algorithm's latency and throughput with the comparison algorithm show good results and the comparison of the Johnson algorithm's trial results is still superior. The response time results of the Johnson algorithm when first performing a route search are faster than the conventional OSPF algorithm due to the characteristics of the all pair shortest path algorithm which determines the shortest route by comparing all pairs of nodes on the network.

Downloads

Download data is not yet available.

References

D. Kreutz, F. M. V. Ramos, P. E. Verissimo, C. E. Rothenberg, S. Azodolmolky, and S. Uhlig, “Software-Defined Networking : A Comprehensive Survey,” in Proc. IEEE, vol. 103, no. 1, pp. 14–76, 2015.

W. Chen, F. Ren, J. Xie, C. Lin, K. Yin, and F. Baker, “Comprehensive Understanding of TCP Incast Problem,” in Proc. IEEE Conf. Comput. Commun., pp. 1688–1696, 2015.

F. H. Saputra and R. M. Ijtihadie, “Survei mekanisme congestion control pada transmission control protocol di software defined network,” JUTI J. Ilm. Teknol. Inf., vol. 6, no. 1, pp. 1–9, 2018.

E. Auparay and R. M. Ijtihadie, “Replikasi data menggunakan detection controller module untuk mencegah congestion di data center,” JUTI J. Ilm. Teknol. Inf., vol. 16, pp. 10–17, 2018.

H. Xin, “Introduction of Centralized and Distributed Routing Protocols,” in Proc. Int. Conf. Electron. Commun. Control, pp. 2698–2701, 2011.

M. Grabowski, B. Musznicki, and P. Zwierzykowski, “Review and Performance Analysis of Shortest Path Problem Solving Algorithms,” Int. J. Adv. Softw., vol. 7, no. July, pp. 20–30, 2014.

A. Nastiti, A. Rakhmatsyah, and M. A. Nugroho, “Link Failure Emulation with Dijkstra and Bellman-Ford Algorithm in Software Defined Network Architecture (Case Study : Telkom University Topology),” in Proc. 2018 6th Int. Conf. Inf. Commun. Technol., vol. 0, no. c, pp. 135–140, 2018.

D. B. Johnson, “Efficient Algorithms for Shortest Paths in Sparse Networks,” J. Assoc. Comput. Mach., vol. 24, no. 1, pp. 1–13, 1977.

Brilliant, “Johnson’s Algorithm,” brilliant.org, 2019. [Online]. Available: https://brilliant.org/wiki/johnsons-algorithm/. [Accessed: 22-Oct-2019].

H. Kim and N. Feamster, “Improving Network Management with Software Defined Networking,” IEEE Communications Magazine, no. February, pp. 114–119, 2013.

A. Prajapati, A. Sakadasariya, and J. P. Computer, “Software Defined Network : Future of Networking,” in Proc. 2018 2nd Int. Conf. Inven. Syst. Control, no. Icisc, pp. 1351–1354, 2018.

S. Azodolmolky, Software Defined Networking with OpenFlow, First Edit. Birmingham, Mumbai: Packt Publishing Ltd., 2013.

B. . R. S Anitha, “Network Reconfiguration for Loss Minimization by Using Johnson’s Algorithm,” in Proc. 2018 4th Int. Conf. Electr. Energy Syst., pp. 680–684, 2018.

H. M. Abu-Ryash and A. Tamimi A., “Comparison Studies for Different Shortest Path Algorithms,” Int. J. Comput. Technol., vol. 14, no. May, pp. 5980–5986, 2015.

A. M. Abdelmoniem and B. Bensaou, “Enforcing Transport-Agnostic Congestion Control in SDN-based Data Centers,” in Proc. IEEE 42nd Conference on Local Computer Networks, 2017, pp. 120–136.

Downloads

Published

2021-01-31

Issue

Vol. 19, No. 1, Januari 2021

Section

Articles

License

All papers should be submitted electronically. All submitted manuscripts must be original work that is not under submission at another journal or under consideration for publication in another form, such as a monograph or chapter of a book. Authors of submitted papers are obligated not to submit their paper for publication elsewhere until an editorial decision is rendered on their submission. Further, authors of accepted papers are prohibited from publishing the results in other publications that appear before the paper is published in JUTI unless they receive approval for doing so from the Editor-in-Chief.

JUTI open access articles are distributed under a Creative Commons Attribution-ShareAlike 4.0 International License. This license lets the audience to give appropriate credit, provide a link to the license, and indicate if changes were made and if they remix, transform, or build upon the material, they must distribute contributions under the same license as the original.

How to Cite

[1]
A. P. Segara, R. M. Ijtihadie, and T. Ahmad, “IMPLEMENTATION OF JOHNSON’S SHORTEST PATH ALGORITHM FOR ROUTE DISCOVERY MECHANISM ON SOFTWARE DEFINED NETWORK”, JUTI, vol. 19, no. 1, pp. 28–36, Jan. 2021, doi: 10.12962/j24068535.v19i1.a1011.