Packet networks require queues (buffers) to absorb short term arrival rate fluctuations. Yet network implementors have always observed that queues at bottlenecks tend to fill and stay filled, which contributes extra delay and removes the ability to absorb bursts. In [1] Floyd and Jacobson proposed the RED (Random Early Detection) active queue management algorithm. RED is simple, robust and quite effective at reducing persistent queues. However, while it has been used widely and successfully on Internet routers, [1] offers little guidance on how to set configuration parameters and RED has gained the reputation of being very difficult to tune. This paper develops RED in different way, treating it as a servo control loop and deriving all the loop parameters from measurable properties of a router. The result is a `self-tuning' RED whose parameters are completely determined by the queue output bandwidth (average departure rate). This new RED performs substantially better than the original version and works for a much wider variety of traffic and link bandwidths. It also admits a substantially simpler and more efficient implementation, one particularly well suited for ASIC forwarding engines. Please note: This is an early draft of an in-progress paper. Several important sections are still missing and the simulation data needs to be reorganized so that the story it tells is clearer. 1.0