K-nearest neighbor algorithm analysis for path determination in network simulation using software defined network

Ritzkal Ritzkal, Suhadi Suhadi, Rizky Amalia, Yuggo Afrianto, Anggra Triawan, Syafrial Syafrial, Fety Fatimah


Software defined network (SDN) is a new approach concept for planning, developing, and operating computer networks. Routing is the process of selecting paths on a network system to send or forward packets to the destination network. This study aims to obtain the results of the calculation analysis using the k-nearest neighbor (k-NN) method as the implementation of the recommendations. The results of the analysis use a mesh topology design approach with predicted values of throughput, jitter, delay, and packet loss. This value is used as a recommendation to the network manager to determine the best path. The best path selection from the analysis results is i) path-1 (very good) which includes switch 1, switch 2, and switch 4; ii) path-2 (good) to switch 1, switch 3 and switch 4 switch 4; iii) channel-3 (moderate) through switch 1, switch 2, switch 3 and switch 4; and iv) channel-4 (bad) through switch 1, switch 3, switch 2, and switch 4. While the calculation using the confusion matrix is accuracy=72.31%, precision=96.08% and recall=87.84%.


Jitters; K-nearest neighbor; Packet loss; Software define network; Throughput

Full Text:


DOI: https://doi.org/10.11591/eei.v12i4.4868


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Bulletin of EEI Stats

Bulletin of Electrical Engineering and Informatics (BEEI)
ISSN: 2089-3191, e-ISSN: 2302-9285
This journal is published by the Institute of Advanced Engineering and Science (IAES) in collaboration with Intelektual Pustaka Media Utama (IPMU).