Performance Evaluation of Various Active Queue Management for Bufferbloat
Kanu Monga1, Krishan Kumar2

1Kanu Monga, Department of Computer Science and Engineering, Shaheed Bhagat Singh State Technical Campus, Ferozepur (Punjab). India.
2Krishan Kumar, Associate Professor, Shaheed Bhagat Singh State Technical Campus, Ferozepur (Punjab). India

Manuscript received on 15 April 2016 | Revised Manuscript received on 25 April 2016 | Manuscript Published on 30 April 2016 | PP: 237-241 | Volume-5 Issue-4, April 2016 | Retrieval Number: D4558045416/16©BEIESP
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (

Abstract: – Due to unprotected large buffers in network devices, the Internet is suffering from high latency and jitter which leads to decreased throughput. The perseveringly full buffer problem, recently exposed as “bufferbloat” [1] [2] has been observed for decades, but is still with us. As a solution to this problem, several new AQM algorithms CoDel, sfqCoDel and CoDel-DT have been proposed. This paper aims to evaluate these AQM algorithms by carrying out simulations in ns-2 and compares their performance with that of DropTail. sfqCoDel outperforms various peer solutions in variety of scenarios in terms of bottleneck link utilization, packet drop rate and mean queue length.
Keywords: AQM, RED, CoDel, Droptail, Bufferbloat

Scope of the Article: Disaster Management