Efficient fair queuing using adaptive RED algorithm for high speed networks

Abstract

In order to reduce the increasing packet loss rates caused by an exponential increase in network traffic, the Internet engineering task force is considering the deployment of active queue management techniques such as RED (random early detection). While active queue management in routers and gateways can potentially reduce packet loss rates in the Internet, this paper has demonstrated the inherent weakness of current techniques and shows that they are ineffective in preventing high loss rates. The inherent problem with these queue management algorithms is that they all use static parameter setting. So, in case where these parameters do not match the requirement of the network load, the performance of these algorithms can approach that of a traditional drop-tail. In this paper, in order to solve this problem, a new active queue management algorithm called ARED (Adaptive RED) is proposed. ARED computes the parameter based on our heuristic method. This algorithm will effectively reduce packet loss while maintaining high link utilizations.