A Comprehensive Performance Analysis of Random Early Detection Mechanism

2004 ◽  
Vol 25 (1/2) ◽  
pp. 9-31 ◽  
Author(s):  
Tuan Anh Trinh ◽  
Sándor Molnár
2017 ◽  
Vol 2 (1) ◽  
pp. 119
Author(s):  
Muhammad Noer Iskandar

<span><em>Bufferbloat </em><span>merupakan salah satu kondisi buffer dengan ukuran besar yang cenderung<br /><span>selalu penuh dan menyebabkan antrian panjang didalam buffer, jika hal ini terjadi secara<br /><span>terus-menerus maka dapat menyebabkan jeda transmisi yang tinggi. <span><em>Bufferbloat </em><span>sering<br /><span>terjadi pada aplikasi berbasis real-time. <span><em>Active Queue Management </em><span>(AQM) merupakan<br /><span>salah satu cara untuk menangani terjadinya <span><em>bufferbloat., </em><span>AQM umumnya menggunakan<br /><span>algoritma Drop Tail untuk menangani kondisi antrian panjang dalam buffer router di<br /><span>jaringan. Namun demikian, performansi AQM berbasis Drop Tail kurang dapat<br /><span>diandalkan karena jeda transmisi dalam keadaan <span><em>bufferbloat </em><span>masih tinggi. Telah banyak<br /><span>studi dilakukan untuk menangani <span><em>bufferbloat</em><span>, seperti Drop Tail, Random Early Detection<br /><span>(RED) dan Controlled Delay (CoDel). Dari riset yang telah dilakukan tersebut masih sulit<br /><span>ditemukan performasi algoritma terbaik dalam menangani <span><em>bufferbloat</em><span>. Untuk hal tersebut,<br /><span>paper ini menyajikan studi performansi penanganan bufferbloat menggunakan ketiga<br /><span>algoritma diatas. Dalam studi ini, video streaming digunakan sebagai <span><em>traffic </em><span>uji untuk<br /><span>menentukan performansi algoritma terbaik dalam mengatasi <span><em>bufferbloat</em><span>. Sedangkan<br /><span>metriks uji yang digunakan dalam riset ini adalah <span><em>latency</em><span>, <span><em>throughput </em><span>dan <span><em>packet-loss</em><span>.<br /><span>Analisa hasil pengujian mengambil 3 hasil terbaik dalam setiap percobaan. Hasil<br /><span>pengujian menunjukan performansi algoritma CoDel jauh lebih baik dalam menangani<br /><span><em>latency </em><span>yang tinggi pada kondisi bufferbloat dibandingkan RED dan Drop Tail. Namun<br /><span>untuk <span><em>packet-loss </em><span>dan <span><em>throughput </em><span>performansi RED dan Drop Tail masih unggul<br /><span>dibanding algoritma CoDel</span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span><br /></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span></span>


2009 ◽  
Vol 179 (22) ◽  
pp. 3893-3907 ◽  
Author(s):  
Yung-Chung Wang ◽  
Chwan-Lu Tseng ◽  
Ren-Guey Chu ◽  
Fu-Hsiang Tsai

10.28945/2920 ◽  
2005 ◽  
Author(s):  
A. A. Akintola ◽  
G. A. Aderounmu ◽  
L. A. Akanbi ◽  
M. O. Adigun

One of the most prominent congestion avoidance schemes in the Internet architecture is the Random Early Detection (RED) algorithm. Several modifications and enhancements have been made to the original RED so as to make it more responsive to congestion avoidance at the gateways. In this paper, we introduced the Dynamic Random Early Detection (DRED) model, which uses a newly introduced parameter i.e. warning line. A robust and efficacious technique to measure the burstiness of incoming traffic has been developed and tested. This involves the estimation of the average queue size, avg, which is dynamically adjusted hence the name of our scheme. The empirical results obtained from the simulations show that our DRED scheme responds early enough to the increased number of packets at the gateway. Also, the maximum drop probability of packets show improved performance over the original RED. It was concluded that our scheme demonstrated superiority by avoiding global synchronization and there is great reduction in the fluctuations of the actual queue size. Also, its early response avoids buffer overflow at the gateways when the queue is near full.


Author(s):  
Julian Bueno ◽  
Joshua Robertson ◽  
Matej Hejda ◽  
Antonio Hurtado

Sign in / Sign up

Export Citation Format

Share Document