Light-weight control of non-responsive traffic with low buffer requirements

Authors:
Venkatesh Ramaswamy;Leticia Cuéllar;Stephan Eidenbenz;Nicolas Hengartner;Christoph Ambühl;Birgitta Weber
Affiliations:
CCS-3, Los Alamos National Laboratory;CCS-3, Los Alamos National Laboratory;CCS-3, Los Alamos National Laboratory;CCS-3, Los Alamos National Laboratory;University of Liverpool, Liverpool, Great Britain;Unilever R&D, Port Sunlight, UK
Venue:
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Year:
2007

Citing 4
Cited 0

High performance TCP in ANSNET

ACM SIGCOMM Computer Communication Review
Sizing router buffers

Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Link Buffer Sizing: A New Look at the Old Problem

ISCC '05 Proceedings of the 10th IEEE Symposium on Computers and Communications
Network Algorithmics,: An Interdisciplinary Approach to Designing Fast Networked Devices (The Morgan Kaufmann Series in Networking)

Network Algorithmics,: An Interdisciplinary Approach to Designing Fast Networked Devices (The Morgan Kaufmann Series in Networking)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose ESREQM (Efficient Sending Rate Estimation Queue Management), a novel active queue management scheme that achieves almost perfect max-min fairness among flows with minimum (constant) per-flow state and a constant number of CPU operations to handle an incoming packet using a single queue with very low buffer requirements. ESREQM estimates sending rates of flows through a history discounting process that allows it to guarantee max-min fairness by automatically adapting parameters. It can also be used to punish non-responsive flows. The per-flow state is limited to a single value per flow, which allows the flow memory to be in SRAM, thereby making packet processing scalable with link speeds. ESREQM results in good link utilization with low buffer size requirements because it provably desynchronizes TCP flows as a by-product. We show our results through a mixture of analysis and simulation. Our scheme does not make assumptions on what transport protocols are used.