In order to achieve high throughput and low average delay in computer network, it is necessary to stabilize the queue length and avoid oscillation or chaos phenomenon. In this paper, based on Adaptive Random Early Detection (ARED), an improved algorithm is proposed, which dynamically changes the range of maximum drop probability p max according to different network scenarios and adjusts p max to limit average queue size q ave in a steady range. Moreover, exponential averaging weight w is adjusted based on linear stability condition to stabilize q ave . A number of simulations show that the improved ARED algorithm can effectively stabilize the queue length and perform better than other algorithms in terms of stability and chaos control.
No takes yet. Share an insight, caveat, or question.
Chen et al. (2010) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: