Melola Discovery

← Melola Discovery

Jurnal SINTA 2

Analisis Kinerja Algoritme TCP Congestion Control Berdasarkan Single dan Multiple Flow pada Multi-Path Routing

Jurnal Teknologi Informasi dan Ilmu Komputer (JTIIK) · Vol. 7 No. 5 (2020) · pp. 961–970

DOI
10.25126/jtiik.2020752402
ISSN
2528-6579, 2355-7699
Published
2020-10-08
Publisher
Fakultas Ilmu Komputer, Universitas Brawijaya
Language
id

Abstract

Teknik multi-path routing merupakan solusi efektif untuk menambah kapasitas bandwidth jaringan. Namun, TCP menggunakan multiple paths sama dengan di single path. Penelitian ini melakukan analisis kinerja algoritme TCP congestion control Reno, BIC, CUBIC, dan BBR pada multi-path routing dengan setiap multiple paths menggunakan cost yang sama. Analisis yang dilakukan meliputi perbandingan antara single path routing dengan multi-path routing, single flow, dan multiple flow. Analisis single flow meliputi link delay dan loss rate. Sedangkan analisis multiple flow meliputi inter TCP protocol fairness dan fairness antara TCP dengan UDP. Semua evaluasi dilakukan berdasarkan emulasi pada VirtualBox. Berdasarkan hasil emulasi, multi-path routing dapat berdampak pada packet reordering, tetapi tidak mengakibatkan penurunan rata-rata throughput yang signifikan. Pada single flow, BBR merupakan algoritme TCP congestion control terbaik pada multi-path routing. Namun, pada multiple flow, CUBIC merupakan algoritme TCP congestion control terbaik pada multi-path routing. Pada evaluasi link delay, rata-rata RTT BBR lebih rendah hingga 58 ms dibandingkan dengan Reno, BIC, dan CUBIC. Sedangkan pada evaluasi loss rate, rata-rata throughput BBR lebih tinggi hingga 12 Mbps dibandingkan dengan Reno, BIC, dan CUBIC. Pada evaluasi inter TCP protocol fairness dan fairness antara TCP dengan UDP, fairness CUBIC paling mendekati 1 dibandingkan dengan Reno, BIC, dan BBR. AbstractThe multi-path routing technique is an effective solution to increase network bandwidth capacity. However, TCP uses multiple paths similar to a single path. This study analyzes the performance of TCP congestion control algorithms Reno, BIC, CUBIC, and BBR on multi-path routing with each multiple paths using the same cost. The analysis includes a comparison between single path routing and multi-path routing, single flow, and multiple flows. In a single flow, the analysis includes link delay and loss rate. Whereas in multiple flows, the analysis includes inter TCP protocol fairness and fairness between TCP and UDP. All evaluations are based on emulation in VirtualBox. Based on the results from emulation, multi-path routing can have an impact on packet reordering but does not result in a significant degrade in average throughput. In a single flow, BBR is the best TCP congestion control algorithm on multi-path routing. However, in multiple flows, CUBIC is the best TCP congestion control algorithm on multi-path routing. In the link delay evaluations, the average RTT on BBR up to 58 ms lower than Reno, BIC, and CUBIC. Whereas in the loss rate evaluations, the average throughput on BBR up to 12 Mbps higher than Reno, BIC, and CUBIC. In the evaluation of inter TCP protocol fairness and fairness between TCP and UDP, fairness on CUBIC is closest to 1 than Reno, BIC, and BBR.

Collaboration network of the authors

40 authors · 68 co-authorship links · 2 across different organisations · showing the 40 most connected

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • University of Brawijaya
  • Politeknik Elektronika Negeri Surabaya
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Fajar PradanaUniversity of Brawijaya10
Retno Indah RokhmawatiUniversity of Brawijaya3
Fitri UtaminingrumUniversity of Brawijaya3
Sabriansyah Rizqika AkbarUniversity of Brawijaya2
Bayu PriyambadhaUniversity of Brawijaya2
Satrio Agung WicaksonoUniversity of Brawijaya2
Eko SetiawanUniversity of Brawijaya2
Imam CholissodinUniversity of Brawijaya2
Muhammad WafiUniversity of Brawijaya2
Novanto YudistiraUniversity of Brawijaya2
Herman TolleUniversity of Brawijaya2
Aisyah AwalinaUniversity of Brawijaya2
Sulandri SulandriUniversity of Brawijaya2
Joseph Ananda SugihdharmaUniversity of Brawijaya1
Rizal Setya PerdanaUniversity of Brawijaya1
Nathanael Victor DarenohUniversity of Brawijaya1
Aditya RachmadiUniversity of Brawijaya1
Barlian HenryranuUniversity of Brawijaya1
Maystia Tri HandonoAffiliation unknown1
Fandisya RahmanUniversity of Brawijaya1
Ismiarta AknurandaUniversity of Brawijaya1
Aulia Akhrian SyahidiUniversity of Brawijaya1
Fajerin BiabdillahUniversity of Brawijaya1
Nanang Yudi SetiawanUniversity of Brawijaya1
Iqbal Taufiq Ahmad NurUniversity of Brawijaya1
Indra SyahputraUniversity of Brawijaya1
Mochammad Dearifaldi Al IkhsanUniversity of Brawijaya1
Khafidzun FadliUniversity of Brawijaya1
Muhammad Jainal ArifinPoliteknik Elektronika Negeri Surabaya1
Bima Sena Bayu DewantaraPoliteknik Elektronika Negeri Surabaya1
Hawwin Purnama AkbarUniversity of Brawijaya1
Rona SalsabilaUniversity of Brawijaya1
Muhammad ZulfikarrahmanUniversity of Brawijaya1
Diva Fardiana RisaUniversity of Brawijaya1
Aisyatul MaulidahUniversity of Brawijaya1
Budi Darma SetiawanUniversity of Brawijaya1
Muhammad Nugraha Delta RevanzaAffiliation unknown1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

Metadata source: OAI-PMH (metadata jurnal) https://jtiik.ub.ac.id/index.php/jtiik/en/oai, first harvested 27 Okt 2026, last seen 27 Okt 2026.
Original metadata (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id">Analisis Kinerja Algoritme TCP Congestion Control Berdasarkan Single dan Multiple Flow pada Multi-Path Routing</dc:title>
	<dc:creator xml:lang="id">Sutawijaya, Bayu</dc:creator>
	<dc:creator xml:lang="id">Basuki, Achmad</dc:creator>
	<dc:creator xml:lang="id">Bachtiar, Fitra Abdurrachman</dc:creator>
	<dc:description xml:lang="id">Teknik multi-path routing merupakan solusi efektif untuk menambah kapasitas bandwidth jaringan. Namun, TCP menggunakan multiple paths sama dengan di single path. Penelitian ini melakukan analisis kinerja algoritme TCP congestion control Reno, BIC, CUBIC, dan BBR pada multi-path routing dengan setiap multiple paths menggunakan cost yang sama. Analisis yang dilakukan meliputi perbandingan antara single path routing dengan multi-path routing, single flow, dan multiple flow. Analisis single flow meliputi link delay dan loss rate. Sedangkan analisis multiple flow meliputi inter TCP protocol fairness dan fairness antara TCP dengan UDP. Semua evaluasi dilakukan berdasarkan emulasi pada VirtualBox. Berdasarkan hasil emulasi, multi-path routing dapat berdampak pada packet reordering, tetapi tidak mengakibatkan penurunan rata-rata throughput yang signifikan. Pada single flow, BBR merupakan algoritme TCP congestion control terbaik pada multi-path routing. Namun, pada multiple flow, CUBIC merupakan algoritme TCP congestion control terbaik pada multi-path routing. Pada evaluasi link delay, rata-rata RTT BBR lebih rendah hingga 58 ms dibandingkan dengan Reno, BIC, dan CUBIC. Sedangkan pada evaluasi loss rate, rata-rata throughput BBR lebih tinggi hingga 12 Mbps dibandingkan dengan Reno, BIC, dan CUBIC. Pada evaluasi inter TCP protocol fairness dan fairness antara TCP dengan UDP, fairness CUBIC paling mendekati 1 dibandingkan dengan Reno, BIC, dan BBR. AbstractThe multi-path routing technique is an effective solution to increase network bandwidth capacity. However, TCP uses multiple paths similar to a single path. This study analyzes the performance of TCP congestion control algorithms Reno, BIC, CUBIC, and BBR on multi-path routing with each multiple paths using the same cost. The analysis includes a comparison between single path routing and multi-path routing, single flow, and multiple flows. In a single flow, the analysis includes link delay and loss rate. Whereas in multiple flows, the analysis includes inter TCP protocol fairness and fairness between TCP and UDP. All evaluations are based on emulation in VirtualBox. Based on the results from emulation, multi-path routing can have an impact on packet reordering but does not result in a significant degrade in average throughput. In a single flow, BBR is the best TCP congestion control algorithm on multi-path routing. However, in multiple flows, CUBIC is the best TCP congestion control algorithm on multi-path routing. In the link delay evaluations, the average RTT on BBR up to 58 ms lower than Reno, BIC, and CUBIC. Whereas in the loss rate evaluations, the average throughput on BBR up to 12 Mbps higher than Reno, BIC, and CUBIC. In the evaluation of inter TCP protocol fairness and fairness between TCP and UDP, fairness on CUBIC is closest to 1 than Reno, BIC, and BBR.</dc:description>
	<dc:publisher xml:lang="en">Fakultas Ilmu Komputer, Universitas Brawijaya</dc:publisher>
	<dc:date>2020-10-08</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://jtiik.ub.ac.id/index.php/jtiik/article/view/2402</dc:identifier>
	<dc:identifier>10.25126/jtiik.2020752402</dc:identifier>
	<dc:source xml:lang="id">Jurnal Teknologi Informasi dan Ilmu Komputer; Vol 7 No 5: Oktober 2020; 961-970</dc:source>
	<dc:source xml:lang="en">Jurnal Teknologi Informasi dan Ilmu Komputer; Vol. 7 No. 5: Oktober 2020; 961-970</dc:source>
	<dc:source>2528-6579</dc:source>
	<dc:source>2355-7699</dc:source>
	<dc:source>10.25126/jtiik.202075</dc:source>
	<dc:language>id</dc:language>
	<dc:relation>https://jtiik.ub.ac.id/index.php/jtiik/article/view/2402/pdf</dc:relation>
	<dc:rights xml:lang="en">Copyright (c) 2020 Jurnal Teknologi Informasi dan Ilmu Komputer</dc:rights>
</oai_dc:dc>