This paper evaluates the effectiveness of Random Early Detection (RED) in managing traffic types categorized as non-adaptive, fragile, and robust. It highlights that RED can lead to unfair bandwidth sharing when different traffic types share a link, as it imposes the same loss rate on all flows regardless of their bandwidths. To address this issue, the authors propose Fair Random Early Drop (FRED), a modified version of RED that uses per-active-flow accounting to impose a loss rate on each flow based on its buffer usage. FRED is shown to provide better protection for adaptive (fragile and robust) flows and more effectively isolate non-adaptive greedy traffic. The paper also introduces a "two-packet-buffer" mechanism to support a large number of flows without incurring additional queueing delays. Simulations demonstrate that FRED performs better than RED in handling TCP and UDP traffic, and it does not require assumptions about the queueing architecture.This paper evaluates the effectiveness of Random Early Detection (RED) in managing traffic types categorized as non-adaptive, fragile, and robust. It highlights that RED can lead to unfair bandwidth sharing when different traffic types share a link, as it imposes the same loss rate on all flows regardless of their bandwidths. To address this issue, the authors propose Fair Random Early Drop (FRED), a modified version of RED that uses per-active-flow accounting to impose a loss rate on each flow based on its buffer usage. FRED is shown to provide better protection for adaptive (fragile and robust) flows and more effectively isolate non-adaptive greedy traffic. The paper also introduces a "two-packet-buffer" mechanism to support a large number of flows without incurring additional queueing delays. Simulations demonstrate that FRED performs better than RED in handling TCP and UDP traffic, and it does not require assumptions about the queueing architecture.