Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Observations on the dynamics of a congestion control algorithm: the effects of two-way traffic
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Efficient fair queueing using deficit round robin
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Hierarchical packet fair queueing algorithms
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Dynamics of random early detection
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
End-to-end internet packet dynamics
IEEE/ACM Transactions on Networking (TON)
Promoting the use of end-to-end congestion control in the Internet
IEEE/ACM Transactions on Networking (TON)
Equation-based congestion control for unicast applications
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Controlling High-Bandwidth Flows at the Congested Router
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
An architecture for large scale Internet measurement
IEEE Communications Magazine
On the robustness of router-based denial-of-service (DoS) defense systems
ACM SIGCOMM Computer Communication Review
Policing congestion response in an internetwork using re-feedback
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Flow rate fairness: dismantling a religion
ACM SIGCOMM Computer Communication Review
A novel proposal to improve fairness in TCP Reno
International Journal of Communication Networks and Distributed Systems
Reflections on the TCP macroscopic model
ACM SIGCOMM Computer Communication Review
Policing freedom to use the internet resource pool
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
Improvement of LRU cache for the detection and control of long-lived high bandwidth flows
Computer Communications
Beyond CHOKe: stateless fair queueing
NET-COOP'07 Proceedings of the 1st EuroFGI international conference on Network control and optimization
Finding frequent elements in non-bursty streams
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Active queue management for MAC client implementation of resilient packet rings
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
On the impact of TCP and per-flow scheduling on internet performance
INFOCOM'10 Proceedings of the 29th conference on Information communications
Approximate fairness through limited flow list
Proceedings of the 23rd International Teletraffic Congress
Fully hardware based WFQ architecture for high-speed QoS packet scheduling
Integration, the VLSI Journal
Fuzzy predictive preferential dropping for active queue management
KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part II
Fair bandwidth allocation without per-flow state
Theoretical Computer Science
UARA in edge routers: an effective approach to user fairness and traffic shaping
International Journal of Communication Systems
On the impact of TCP and per-flow scheduling on internet performance
IEEE/ACM Transactions on Networking (TON)
EyeQ: practical network performance isolation at the edge
nsdi'13 Proceedings of the 10th USENIX conference on Networked Systems Design and Implementation
Modeling residual-geometric flow sampling
IEEE/ACM Transactions on Networking (TON)
Computer Networks: The International Journal of Computer and Telecommunications Networking
SENIC: scalable NIC for end-host rate limiting
NSDI'14 Proceedings of the 11th USENIX Conference on Networked Systems Design and Implementation
| Hi-index | 0.00 |
Many researchers have argued that the Internet architecture would be more robust and more accommodating of heterogeneity if routers allocated bandwidth fairly. However, most of the mechanisms proposed to accomplish this, such as Fair Queueing [16, 6] and its many variants [2, 23, 15], involve complicated packet scheduling algorithms. These algorithms, while increasingly common in router designs, may not be inexpensively implementable at extremely high speeds; thus, finding more easily implementable variants of such algorithms may be of significant practical value. This paper proposes an algorithm called Approximate Fair Dropping (AFD), which bases its dropping decisions on the recent history of packet arrivals. AFD retains a simple forwarding path and requires an amount of additional state that is small compared to current packet buffers. Simulation results, which we describe here, suggest that the design provides a reasonable degree of fairness in a wide variety of operating conditions. The performance of our approach is aided by the fact that the vast majority of Internet flows are slow but the fast flows send the bulk of the bits. This allows a small sample of recent history to provide accurate rate estimates of the fast flows.