Probability and average occupancy calculations in RED algorithm

We present several improvements to the RED (random early detection) algorithm. These improvements include simplified, faster calculations of discard probability, and a new "double-weight" method of average calculations. In this method, the RED algorithm reacts to changes of queue occupancy more "intelligently", providing better values of its average. Our findings are supported by simulation results. We also take a look at differences between two variations of the RED algorithm, pointing out the one that offers a better control over calculations of average occupancy, thereby offering lower packet loss and improved performance.