PROBABILITY ADAPTIVE RED IN TCP/IP NETWORKS

The proposed AQM algorithm by the IETF is Random Early Detection (RED). The RED algorithm allows network operators simultaneously to achieve high throughput and low average delay. However, the resulting average queue length is quite sensitive to the level of congestion and the RED parameter settings, and is therefore not predicable in advance. To achieve a predictability of performance would require constant tuning of the parameters to adjust to current traffic conditions. We evaluate the performance of the RED and Adaptive RED algorithms. We propose a Probability Adaptive RED (PARED) that can maintain high throughput and low packet drop under dynamic traffic loads.