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
Fluid-based analysis of a network of AQM routers supporting TCP flows with an application to RED
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
ACM SIGCOMM Computer Communication Review
A Quantitative Model for the Parameter Setting of RED with TCP Traffic
IWQoS '01 Proceedings of the 9th International Workshop on Quality of Service
Handling HTTP flows over a DiffServ framework
Proceedings of the 4th international IFIP/ACM Latin American conference on Networking
Simulating flow level bandwidth sharing with pareto distributed file sizes
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
A spike-detecting AQM to deal with elephants
Computer Networks: The International Journal of Computer and Telecommunications Networking
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Several objectives have been identified in developing the random early drop (RED): decreasing queueing delay, increasing throughput, and increasing fairness between short and long lived connections. It has been believed that indeed the drop probability of a packet in RED does not depend on the size of the file to which it belongs. In this paper we study the fairness properties of RED where fairness is taken with respect to the size of the transferred file. We focus on short lived TCP sessions. Our findings are that (i) in terms of loss probabilities, RED is unfair: it favors short sessions, (ii) RED is fairer in terms of the average throughput of a session (as a function of its size) than in terms of loss probabilities. We study various loading regimes, with various versions of RED.