The Algorithm and Model of Trash: A Scheme Enforcing Equal Share

Authors:
Yongxiang Zhao;Changjia Chen
Affiliations:
-;-
Venue:
ICCNMC '01 Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01)
Year:
2001

Citing 5
Cited 1

Random early detection gateways for congestion avoidance

IEEE/ACM Transactions on Networking (TON)
Dynamics of random early detection

SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Core-stateless fair queueing: achieving approximately fair bandwidth allocations in high speed networks

Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Modeling TCP throughput: a simple model and its empirical validation

Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Promoting the use of end-to-end congestion control in the Internet

IEEE/ACM Transactions on Networking (TON)

A multiple flow regulator in communication networks

ICCC '02 Proceedings of the 15th international conference on Computer communication

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 it's 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.