An Exact Solution to an Approximated Model of RED

In this paper, the authors propose an analytical model to capture the dynamics of the RED algorithm. They first develop a system of recursive equations that describes the packet dropping behavior of the RED algorithm. Using a notion from the theory of random walks, they then derive an exact-closed form expression that characterizes the loss characteristics of a RED queue. They validate the derived formula by a numerical comparison with the recursive equations. The traditional Internet architecture relies on a best-effort architecture for all kinds of data traffic.