Penerapan Algoritma Floyd-Warshall untuk Pemilihan Rute Routing OSPF pada Jaringan SDN
Main Article Content
Abstract
Article Details
Submission of an original manuscript to the journal will be taken to mean that it represents originality work not previously published. Please see JIEET (Journal of Information Engineering and Educational Technology) originality guidelines for details. Use this in conjunction with the points below about references, before submission i.e. always attribute clearly using either indented text or quote marks as well as making use of the preferred IEEE style of formatting. Authors submitting articles for publication warrant that the work is not an infringement of any existing copyright and will indemnify the publisher against any breach of such warranty. For ease of dissemination and to ensure proper policing of use, papers and contributions become the legal copyright of the publisher unless otherwise agreed.
The editor may make use of Thurnitin software for checking the originality of submissions received.
References
J. Xie, F. R. Yuy, T. Huang, R. Xie, J. Liu, C. Wangz dan Y. Liu, œA Survey of Machine Learning Techniques Applied to Software Defined Networking (SDN): Research Issues and Challenges, IEEE Communications Surveys & Tutorials, pp. 1-39, 2018.
S. Tomovic, M. Radonjic dan I. Radusinovic, œBandwidth-Delay Constrained Routing Algorithms for Backbone SDN Networks, TELSIKS 2015, pp. 227-230, 2015.
J. Bhatia, R. Govani dan Y. Modi. (2017) OpenSource. [Online], http://opensourceforu.com/2017/10/primer-software-defined-networking-sdn-openflow-standard/, tanggal akses: 13 Mei 2020.
I. A. Saputra, Rumani. R. M. dan S. N. Hertiana, œUji Performansi Algoritma Floyd-Warshall pada Jaringan Software Defined Network (SDN), Jurnal Elektronika dan Telekomunikasi, Vol. 16(2), hal. 52-58, 2016.
I. Attamimi, W. Yahya & M. H. Hanafi, œAnalisis Perbandingan Algoritma Floyd-Warshall dan Dijkstra untuk Menentukan Jalur Terpendek Pada Jaringan Openflow, Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer, hal. 1842-1849, 2017.
R. M. Negara and R. Tulloh, œAnalisis Simulasi Penerapan Algoritma OSPF Menggunakan RouteFlow pada Jaringan Software Defined Network (SDN), Jurnal Infotel Vol.9 No.1 Februari 2017, hal. 75-83, 2017.
F. Ramadhan, R. Primananda and W. Yahya, œImplementasi Routing Berbasis Algoritme Dijkstra Pada Software Defined Networking Menggunakan Kontroler Open Network Operating System, Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer, pp. 2531-2541, 2018.
E. D. Asabere, J. K. Panford and J. B. Hayfron-Acquah, œComparative Analysis Of Convergence Times Between Ospf, Eigrp, Is-Is And Bgp Routing Protocols In A Network, International Journal of Computer Science and Information Security (IJCSIS) Vol. 15(12), pp. 225-227, 2017.
(2014) OmniSecu. [Online], http://www.omnisecu.com/cisco-certified-network-associate-ccna/what-is-ospf-metric-value-cost-and-ospf-default-cost-reference-bandwidth.php, tanggal akses: 14 April 2020.
A. Ojo, N.-W. Ma and I. Woungang, œModified Floyd Warshall Algorithm for Equal Cost Multipath in Software Defined Data Center, in Workshop on Advances in Software Defined and Context Aware Cognitive Network (IEEE SCAN-2015), 2015.
Telecommunications and Internet Protocol Harmonization Over Networks (TIPHON); General aspects of Quality of Service (QoS) TR 101 329 V2.1.1, 1999.