Network Routing Optimization Using Tabu Search Algorithm in Dynamic Routing
DOI:
https://doi.org/10.24014/coreit.v9i2.26655Abstract
Internet penetration is increasing along with the need for data packages for communication such as social media, chatting, video conferencing and others. On large-scale networks such as the Internet, dynamic routing is used to build routing protocol information in the routing table automatically. Currently, Djikstra's algorithm is used to solve the shortest path problem in dynamic routing. In this research, the optimization of the algorithm is carried out in determining the best path or trajectory. One of the optimization algorithms is the Tabu Search Algorithm which can guide heuristic local search procedures to explore the solution area outside the local optimum point. This optimization is assessed from the test parameters measured from the smallest cost. The data analyzed is in the form of bandwidth and topological flow. From the results of tracing the path of data packets sent through 9 routers using the Tabu Search algorithm with the parameters namely number of Neighbor Solutions = 50, Length of tabu list = 10, Maximum Number of Iterations = 100, the result of the path matrix value is 180.9676. The path taken is router 0-2-4-8-9
References
K. S, "Digital in 2017: Global Overview.," 2017. [Online]. Available: https://wearesocial.com/special-reports/digital-in-2017-global-overview.
S. S, Jaringan Komputer, Politeknik Elektronika Negeri Surabaya, 2014.
H. Nugroho, Matematika Diskrit dan Implementasinya dalam Dunia Teknologi Informasi, Deepublish, 2015.
R. Munir, Matematika Diskrit, Bandung: Informatika Bandung, 2015.
R. Kumar and M. Kumar, "Exploring Genetic Algorithm for Shortest Path Optimization in Data Networks," Global Journal of Computer Science and Technology , vol. 10, no. 11, pp. 8-12, 2010.
B. &. W. P. Santosa, Metoda Metaheuristik, Konsep dan Implementasi., 2011.
C. D. Tarantilis, "Adaptive multi-restart Tabu Search algorithm for the vehicle routing problem with cross-docking Optimization Letters," vol. 7, p. 1583–1596, 2013.
S. H. P. G. Belhaiza, " A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows Computers Operations Research 2014," vol. 52, pp. 269-281, 2014.
I. Martina, "Penerapan Algoritma Genetika dengan Crossover Cut and Splice dalam Optimasi Routing Jaringan. Jurnal Telematika,," 2011. [Online]. Available: http://journal.ithb.ac.id/telematika/article/view/50.
R. Novrianti, Analisa Algoritma Tabu Search untuk Penjadwalan Mata Pelajaran di SMPN 1 Cisolok Palabuhanratu, Sukabumi: 10104311, 2008.
I. S. O. &. D. R. Varita, "Pencarian Jalur Tercepat Rute Perjalanan Wisata dengan Algoritma Tabu Search.," vol. 2, pp. 185-190, 2013.
F. &. L. M. Glover, Tabu Search., 2007.
E. D, Kajian Algoritma Routing dalam Jaringan Komputer. , vol. 2(1), p. Edi D.
B. L. Fox, " Integrating and Accelerating Tabu Search, Simulated Annealing and Genetic Algorithms. Annals of Operations Research,," 4, Vols. 41(2), 47–67. , pp. 56 - 67, 1993.
Suyanto, Algoritma Optimasi: Deterministik atau Probabilistik. Graha Ilmu., 2014.
S. G. M. d. S. M. . Optimasi Penjadwalan Perkuliahan dengan Menggunakan Algoritma Genetika (Studi Kasus : AMIK MDP, "Witary, V., Rachmat, N., & Inayatullah. (2013)," 1–7.
"Tarantilis," Adaptive Multi-restart Tabu Search Algorithm for the Vehicle Routing Problem with Cross-docking. Optimization Letters, no. Jurnal STMIK GI MDP, 1–7., pp. 1583 - 1596.
A. I. &. H. B. Wijaya, "Manajemen Bandwidth dengan Metode HTB (Hierarchical Token Bucket) pada Sekolah Menengah Pertama Negeri 5 Semarang.," Jurnal Teknik Informatika Udinus, vol. 1, no. 1, p. 5–7., 2014.
S. Saldi, "Implementasi Algoritma Tabu Search Dalam Pewarnaan Simpul Graf (STUDI KASUS : Penjadwalan mata kuliah jurusan matematika fakultas sains dan teknologi UIN Alauddin Makassar). Journal of Personality and Social Psychology,," 1(1), 1188–1197. , pp.
Downloads
Published
Issue
Section
License
The Authors submitting a manuscript do so on the understanding that if accepted for publication, copyright of the article shall be assigned to CoreIT journal and published by Informatics Engineering Department Universitas Islam Negeri Sultan Syarif Kasim Riau as publisher of the journal.
Authors who publish with this journal agree to the following terms:
Authors automatically transfer the copyright to the journal and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution-ShareAlike (CC BY SA) that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
Authors are able to enter into separate permission for non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
