Name
Abstract | ||
|---|---|---|
Short-lived traffic surges, known as microbursts, can cause periods of unexpectedly high packet delay and loss on a link. Today, preventing microbursts requires deploying switches with larger packet buffers (incurring higher cost) or running the network at low utilization (sacrificing efficiency). Instead, we argue that switches should detect microbursts as they form, and take corrective action before the situation gets worse. This requires an efficient way for switches to identify the particular flows responsible for a microburst, and handle them automatically (e.g., by pacing, marking, or rerouting the packets). However, collecting fine-grained statistics about queue occupancy in real time is challenging, even with emerging programmable data planes. We present Snappy, which identifies the flows responsible for a microburst in real time. Snappy maintains multiple snapshots of the occupants of the queue over time, where each snapshot is a compact data structure that makes eicient use of data-plane memory. As each new packet arrives, Snappy updates one snapshot and also estimates the fraction of the queue occupied by the associated flow. Our simulations with data-center packet traces show that Snappy can target the flows responsible for microbursts at the sub-millisecond level.
|
Year | Venue | Field |
|---|---|---|
2018 | SelfDN@SIGCOMM | Data structure,Computer science,Network packet,Queue,Computer network,Microburst,Snapshot (computer storage) |
DocType | ISBN | Citations |
Conference | 978-1-4503-5914-6 | 2 |
PageRank | References | Authors |
0.37 | 9 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiaoqi Chen | 1 | 33 | 6.26 |
| Shir Landau Feibish | 2 | 37 | 5.78 |
| Yaron Koral | 3 | 6 | 0.77 |
| Jennifer Rexford | 4 | 14378 | 1195.34 |
| Ori Rottenstreich | 5 | 318 | 29.90 |