Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Fluid-based analysis of a network of AQM routers supporting TCP flows with an application to RED
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
BLUE: an alternative approach to active queue management
NOSSDAV '01 Proceedings of the 11th international workshop on Network and operating systems support for digital audio and video
Analysis and design of an adaptive virtual queue (AVQ) algorithm for active queue management
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Host-to-Host Congestion Control for TCP
IEEE Communications Surveys & Tutorials
| Hi-index | 0.00 |
Random Early Detection (RED) is a widely deployed active queue management mechanism to improve the performance of the network in terms of throughput and packet drop rate. The effectiveness of RED, however, highly depends on appropriate setting of its parameters. In this paper, we propose a Fast Adapting Random Early Detection (FARED) algorithm which efficiently varies the maximum drop probability to improve the overall performance of the network. Based on extensive simulations, we show that FARED algorithm reduces the packet drop rate and achieves better throughput than Adaptive RED (ARED) and Refined Adaptive RED (Re-ARED). Moreover, FARED algorithm does not introduce new parameters to improve the performance and hence can be deployed without any additional complexity.