Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ Buletin Teknik Elekt...arrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
Buletin Teknik Elektro dan Informatika
Article . 2023 . Peer-reviewed
License: CC BY SA
Data sources: Crossref
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
Buletin Teknik Elektro dan Informatika
Article . 2023 . Peer-reviewed
License: CC BY SA
Data sources: Crossref
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ZENODO
Article . 2023
License: CC BY
Data sources: ZENODO
versions View all 3 versions
addClaim

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

Authors: Ritzkal; Suhadi; Rizky Amalia; Yuggo Afrianto; Anggra Triawan; Syafrial; Fety Fatimah;

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

Abstract

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%.

Keywords

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

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    3
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Top 10%
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
    OpenAIRE UsageCounts
    Usage byUsageCounts
    visibility views 6
    download downloads 7
  • 6
    views
    7
    downloads
    Powered byOpenAIRE UsageCounts
Powered by OpenAIRE graph
Found an issue? Give us feedback
visibility
download
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
views
OpenAIRE UsageCountsViews provided by UsageCounts
downloads
OpenAIRE UsageCountsDownloads provided by UsageCounts
3
Top 10%
Average
Average
6
7
gold