摘要

Random Early Detection (RED) is an active queue management (AQM) mechanism for routers on the Internet. In this paper, performance of RED and Adaptive RED are compared from the viewpoint of nonlinear dynamics. In particular, we reveal the relationship between the performance of the network and its nonlinear dynamical behavior. We measure the maximal Lyapunov exponent and Hurst parameter of the average queue length of RED and Adaptive RED, as well as the throughput and packet loss rate of the aggregate traffic on the bottleneck link. Our simulation scenarios include FTP flows and Web flows, one-way and two-way traffic. In most situations, Adaptive RED has smaller maximal Lyapunov exponents, lower Hurst parameters, higher throughput and lower packet loss rate than that of RED. This confirms that Adaptive RED has better performance than RED.