On Fair Bandwidth Sharing with RED

One weakness of the RED algorithm typical of routers in the current Internet is that it allows unfair bandwidth sharing when a mixture of traffic types shares a link. This unfairness is caused by the fact that, at any given time, RED imposes the same loss probability on all flows, regardless of their bandwidths. In this paper, we propose Random Rate-Control RED (RRC-RED), a modified version of RED. RRC-RED uses per-active-flow accounting to enforce on each flow a loss rate than depends on the flow's own rate. This papers shows than RRC-RED provides better protection than RED and its variants to solve that problems (like FRED, CHOKe or RED-PD), and, moreover, it is easier to implement and lighter in complexity.