Published: 2026-07-01
Desain Topologi Jaringan (FTTR) Berbasis (GPON) dengan Pendekatan Algoritma Dijkstra di SMK NU Ma'arif Kudus
DOI: 10.35870/jtik.v10i3.6549
Rizky Alhusani Gifari, Nur Aeni Widiastuti, Gentur Wahyu Nyipto Wibowo
- Rizky Alhusani Gifari: Universitas Islam Nahdlatul Ulama Jepara
- Nur Aeni Widiastuti: Universitas Islam Nahdlatul Ulama Jepara
- Gentur Wahyu Nyipto Wibowo: Universitas Islam Nahdlatul Ulama Jepara
Article Metrics
- Scopus Citations
- Google Scholar
- Crossref Citations
- Semantic Scholar
- DataCite Metrics
-
If the link doesn't work, copy the DOI or article title for manual search (API Maintenance).
Abstract
The need for reliable internet connectivity in educational environments is crucial, but is often hampered by inefficient network infrastructure. This study aims to design an optimal Fiber To The Room (FTTR) network topology design based on Gigabit Passive Optical Network (GPON) at SMK NU Ma'arif Kudus, focusing on the efficiency of fiber optic cable installation routes. The research method used is engineering design with a quantitative approach, where the school architectural plan is modeled into a weighted graph. Route optimization is carried out by implementing the Dijkstra Algorithm to find the shortest path from the center node (ODC) to all node termination points (ODP). While node I (ODC) is designated as the starting node because it functions as the network distribution center. The calculation process is carried out by determining the minimum distance from the starting node to all destination nodes (ODP). The calculation results show that the shortest path is divided into two main routes, namely I to C to B to A to D to E and I to F to G to H. The selection of this node is proven to be able to produce a more efficient total distance compared to direct paths in several network segments. Based on these results, it can be concluded that Dijkstra's algorithm is effective in fiber optic network planning because it can optimally determine the path with the minimum distance. The application of this method is expected to assist in decision-making regarding fiber optic network infrastructure planning, making it more efficient and applicable for implementation in school environments.
Keywords
Dijkstra's Algorithm; Weighted Graph; Fiber Optic Network; Topology Design Route Efficiency
Peer Review Process
This article has undergone a double-blind peer review process to ensure quality and impartiality.
Indexing Information
Discover where this journal is indexed at our indexing page.
Open Science Badges
This journal supports transparency in research and encourages authors to meet criteria for Open Science Badges.
How to Cite
Article Information
This article has been peer-reviewed and published in the Jurnal JTIK (Jurnal Teknologi Informasi dan Komunikasi). The content is available under the terms of the Creative Commons Attribution 4.0 International License.
-
Issue: Vol. 10 No. 3 (2026)
-
Section: Computer & Communication Science
-
Published: 2026-07-01
-
License: CC BY 4.0
-
Copyright: © 2026 Authors
-
DOI: 10.35870/jtik.v10i3.6549
AI Research Hub
This article is indexed and available through various AI-powered research tools and citation platforms. Our AI Research Hub ensures that scholarly work is discoverable, accessible, and easily integrated into the global research ecosystem.
Rizky Alhusani Gifari, Universitas Islam Nahdlatul Ulama Jepara
Teknik Informatika, Fakultas Sains Dan Teknologi, Universitas Islam Nahdlatul Ulama Jepara, Kabupaten Jepara, Provinsi Jawa Tengah, Indonesia.
Nur Aeni Widiastuti, Universitas Islam Nahdlatul Ulama Jepara
Teknik Informatika, Fakultas Sains Dan Teknologi, Universitas Islam Nahdlatul Ulama Jepara, Kabupaten Jepara, Provinsi Jawa Tengah, Indonesia.
-
Abusalim, S. W. G., Ibrahim, R., Zainuri Saringat, M., Jamel, S., & Abdul Wahab, J. (2020). Comparative analysis between Dijkstra and Bellman-Ford algorithms in shortest path optimization. IOP Conference Series: Materials Science and Engineering, 917(1). https://doi.org/10.1088/1757-899X/917/1/012077.
-
-
Ananda, R., Alamsyah, H., & Mardiana, Y. (2025). Development of WiFi 6 based computer network at LPK Sulthoon 4M. Jurnal Media Computer Science, 4(1), 63–78. https://doi.org/10.37676/jmcs.v4i1.7709.
-
Berutu, I., Auzi, S., Ashillah, S., & Harliana, P. (2024). Integrasi algoritma Dijkstra pada aplikasi QGIS untuk simulasi rute tercepat di Medan: Studi kasus rute dari Universitas Negeri Medan ke Rumah Sakit Royal Prima. JATI (Jurnal Mahasiswa Teknik Informatika), 9(1), 453–461. https://doi.org/10.36040/jati.v9i1.12296.
-
-
-
Gautama, I. P. W., & Hermanto, K. (2020). Penentuan rute terpendek dengan menggunakan algoritma Dijkstra pada jalur bus sekolah. Jurnal Matematika, 10(2), 116. https://doi.org/10.24843/jmat.2020.v10.i02.p128.
-
Gofur, A. (2023). Problematika pelaksanaan Asesmen Nasional Berbasis Komputer (ANBK) sekolah di Kabupaten Seruyan. Adaara: Jurnal Manajemen Pendidikan Islam, 13(1), 1–9. https://doi.org/10.30863/ajmpi.v13i1.3828.
-
-
-
Ibrahim, M. Y., & Nawaningtyas, N. (2025). Evaluasi kinerja jaringan FTTH berbasis ODC dan GPON berdasarkan Power Link Budget di RT 015 Tanjung Duren Utara. Sudo Jurnal Teknik Informatika, 4(2), 112–123. https://doi.org/10.56211/sudo.v4i2.945.
-
Ibrahim, M., Suryayusra, & Wijaya, A. (2024). Analisis perencanaan pembangunan jaringan fiber optik pada Pemerintahan Kota Palembang. Sci-tech Journal, 3(1), 74–82. https://doi.org/10.56709/stj.v3i1.388.
-
-
Rahman, P. S., & Irwanto, I. (2025). Analisis redaman fiber optik pada PT. Telkom STO Serang pada jarak transmisi Serang-Ciruas menggunakan alat ukur Optical Time Domain Reflectometer (OTDR). Teknika, 10(1), 62–68. https://doi.org/10.52561/teknika.v10i1.437.
-
-
Suwandi, A. Y., & Mulyana, D. I. (2024). Optimasi Gigabit Passive Optical Network dan algoritma Naïve Bayes dalam analisis jaringan FTTH. Jurnal JTIK (Jurnal Teknologi Informasi dan Komunikasi), 9(1), 186–192. https://doi.org/10.35870/jtik.v9i1.3058.
-
-
-
-
Zeng, T., Li, Q., Li, H., Zhang, D., & Jiang, M. (2023). China Telecom’s research and applications of business-enterprise full-optical networking. IEEE Access, 11, 55824–55833. https://doi.org/10.1109/ACCESS.2023.3239882.

This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
1. Copyright Retention and Open Access License
Authors retain copyright of their work and grant the journal non-exclusive right of first publication under the Creative Commons Attribution 4.0 International License (CC BY 4.0).
This license allows unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
2. Rights Granted Under CC BY 4.0
Under this license, readers are free to:
- Share — copy and redistribute the material in any medium or format
- Adapt — remix, transform, and build upon the material for any purpose, including commercial use
- No additional restrictions — the licensor cannot revoke these freedoms as long as license terms are followed
3. Attribution Requirements
All uses must include:
- Proper citation of the original work
- Link to the Creative Commons license
- Indication if changes were made to the original work
- No suggestion that the licensor endorses the user or their use
4. Additional Distribution Rights
Authors may:
- Deposit the published version in institutional repositories
- Share through academic social networks
- Include in books, monographs, or other publications
- Post on personal or institutional websites
Requirement: All additional distributions must maintain the CC BY 4.0 license and proper attribution.
5. Self-Archiving and Pre-Print Sharing
Authors are encouraged to:
- Share pre-prints and post-prints online
- Deposit in subject-specific repositories (e.g., arXiv, bioRxiv)
- Engage in scholarly communication throughout the publication process
6. Open Access Commitment
This journal provides immediate open access to all content, supporting the global exchange of knowledge without financial, legal, or technical barriers.