PERBANDINGAN KINERJAALGORITMA BIC, CUBIC, FAST DAN HTCP PADA JARINGAN KOMPUTER KECEPATAN TINGGI DENGANWAKTU TUNGGU BESAR MENGGUNAKAN NS2
| Main Authors: | , Rian Fahrizal, , Ir. Wahyu Dewanto, M.T. |
|---|---|
| Format: | Thesis NonPeerReviewed |
| Terbitan: |
[Yogyakarta] : Universitas Gadjah Mada
, 2011
|
| Subjects: | |
| Online Access: |
https://repository.ugm.ac.id/90514/ http://etd.ugm.ac.id/index.php?mod=penelitian_detail&sub=PenelitianDetail&act=view&typ=html&buku_id=53349 |
Daftar Isi:
- Conventional TCP algorithm had the implementation problems in long fat network. Therefore there were another that had been implemented in Linux kernel such as BIC, CUBIC, and HTCP, and another algorithm such as FAST. This research tries to find the best algorithm to implement in long fat network with simulation. The simulation contain four topology such as multihome, dumbbell, parkinglot and simple network. The simulations run in simulation software in Network Simulator ns2. This research use ns2 software to simulate all of network topologies. The output values for the simulation is throughput values. These values recalculate to find the average throughput, stability, and intra protocol fairness. The simulation showed that the best algorithm based on the average throughput and fairness values is FAST. BIC algorithm was the best algorithm based on stability value. The simulation showed the best algorithm based on overall performance values is FAST algorithm.