Name
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. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/978-3-540-72606-7_73 | Networking |
Keywords | Field | DocType |
light-weight control,low buffer requirement,esreqm result,max-min fairness,incoming packet,per-flow state,link speed,constant number,low buffer size requirement,non-responsive traffic,good link utilization,flow memory,queue management,max min fairness,active queue management,transport protocol | Multilevel queue,Computer science,Active queue management,Network packet,Queue,Computer network,Real-time computing,Packet processing,Queue management system,Scalability,Distributed computing,Fair queuing | Conference |
Volume | ISSN | Citations |
4479 | 0302-9743 | 1 |
PageRank | References | Authors |
0.41 | 6 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Venkatesh Ramaswamy | 1 | 25 | 4.50 |
| Leticia Cuellar | 2 | 48 | 5.98 |
| Stephan Eidenbenz | 3 | 1302 | 103.03 |
| Nicolas Hengartner | 4 | 78 | 7.88 |
| Christoph Ambühl | 5 | 357 | 18.50 |
| Birgitta Weber | 6 | 7 | 1.32 |