Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Dynamics of IP traffic: a study of the role of variability and the impact of control
Proceedings of the 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)
Counting the number of active flows on a high speed link
ACM SIGCOMM Computer Communication Review
Short Survey: A survey of TCP-friendly router-based AQM schemes
Computer Communications
An active queue management scheme based on a capture-recapture model
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
Router-based algorithms to address the TCP-friendliness problem have focused on providing fairness to TCP connections by penalizing UDP unresponsive flows. As a result, current schemes have overlooked their effect on streaming applications. In addition, current schemes have not been widely implemented in practice because of their high complexity and their inability to provide fairness when multiple unresponsive flows, packets of different sizes, and bursty traffic are present. All these aspects and scenarios, commonly found in practice, are rarely addressed in the literature. In this paper, we present Achieving Fairness using a Credit-based mechanism or AFC, a simple Fair Active Queue Management (FAQM) mechanism that aims to solve the unfairness problems generated under these realistic conditions. Simulation results show that AFC provides smoother transfer rates for unresponsive flows transmitting real-time traffic, handles multiple heavy unresponsive flows better, improves the fairness among TCP connections with different round-trip delays, and achieves good fairness even under bursty traffic and packets of different sizes.