Name
Abstract | ||
|---|---|---|
Recent model-based congestion control algorithms such as BBR use repeated measurements at the end-point to build a model of the network connection and use it to achieve optimal throughput with low queuing delay. Conversely, applying this model-based approach to Active Queue Management (AQM) has so far received less attention. We propose the new AQM scheduler cocoa based on fair queuing, which adapts the buffer size depending on the needs of each flow without requiring active participation from the endpoint. We implement this scheduler for the Linux kernel and show that it interacts well with the most common congestion control algorithms and can significantly increase throughput compared to CoDel while avoiding overbuffering. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1145/3375235.3375236 | BS |
Field | DocType | Citations |
Computer science,Computer network,Queueing theory,Network congestion | Conference | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Maximilian Bachl | 1 | 11 | 3.09 |
| Joachim Fabini | 2 | 91 | 19.96 |
| Tanja Zseby | 3 | 199 | 36.35 |