The algorithm and model of Trash: A scheme enforcing equal share

As a stateless buffer management scheme, Trash algorithm is aimed to protect TCP friendly flows from non-responsible UDP through the fair allocation of network resources. The algorithm and its theoretical model are discussed in this paper. In the model, all interested working parameters of the Trash can be easily derived from given system settings. Simulation shows that this model is an useful practical model in its precision and simplicity. Two related problems, trash control behavior and the relations between average queue lengths vs. loss rate of RED, are also studied and solved in this paper.