The pursuit of efficient IP resource management has been the main thrust behind Active Queue Management (AQM) research. Random Early Detection (RED), the defacto standard and its different flavours have been proposed as simple solutions to the AQM problem. These approaches, however, are known to suffer from problems like parameter sensitivity and inability to capture variations in the input traffic accurately, thereby resulting in unstable behaviour. This paper presents a proactive prediction based queue management scheme called PAQMAN that captures variations in the underlying traffic accurately and regulates the queue size around the desirable operating point. PAQMAN harnesses the predictability in the underlying traffic by applying the Recursive Least Squares (RLS) algorithm to estimate the average queue length for the next prediction interval given the average queue length information of the past intervals. This predicted average queue length then drives the computation of the packet drop probability. The performance of PAQMAN has been evaluated and compared against the RED scheme through ns-2 simulations that encompass a wide variety of network conditions. In addition to its simplicity and a negligible computational overhead, PAQMAN maintains a relatively low queue size, high link utilization and low packet loss (and hence better Quality of Service (QoS)) in comparison to RED as is shown by our simulation results. Moreover, it does not maintain any per flow state and hence scalability is not an issue.
|Publication status||Published - 2006|