Introducing Additional Network Measurements into Active Queue Management

Abstract

AQM algorithm is one of the effective methods to alleviate network congestion. The traditional AQM algorithms (RED, CoDel, PIE, BLUE) are usually based on limited information (such as queue length, the delay time, etc.). In this paper, we propose an AQM algorithm named Sketch-AQM which is inspired by the RED algorithm but introduces an additional size-controlled structure to achieve fine-grained flow control. Similar to the RED algorithm, Sketch-AQM algorithm judges the network congestion state mainly based on the average queue length, but the drop policy is adjusted to make full use of the new measurement structure to balance fairness and efficiency. We tested the performance of the algorithm in NS-3. Compared with RED, PIE, and CoDel algorithms, on the basis of maintaining throughput performance, the average queue length of Sketch-AQM algorithm is reduced by an average of 88%, the number of passive packet drop is reduced by about 65% on average. The simulation results show that our algorithm implements a fine-grained packet drop strategy to quickly identify and relieve congestion.