Name
Abstract | ||
|---|---|---|
Network management relies on an up-to-date and accurate view of many traffic metrics for tasks such as traffic engineering (e.g., heavy hitters), anomaly detection (e.g., entropy of source addresses), and security (e.g., DDoS detection). Obtaining an accurate estimate of these metrics while using little router CPU and memory is challenging. This in turn has inspired a large body of work in data streaming devoted to developing optimized algorithms for individual monitoring tasks, as well as recent approaches to make it simpler to implement these algorithms (e.g., OpenSketch). While this body of work has been seminal, we argue that this trajectory of crafting special purpose algorithms is untenable in the long term. We make a case for a \"RISC\" approach for flow monitoring analogous to a reduced instruction set in computer architecture---a simple and generic monitoring primitive from which a range of metrics can be computed with high accuracy. Building on recent theoretical advances in universal streaming, we show that this \"holy grail\" for flow monitoring might be well within our reach. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1145/2834050.2834098 | The Workshop on Hot Topics in Networks |
DocType | Citations | PageRank |
Conference | 2 | 0.43 |
References | Authors | |
29 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zaoxing Liu | 1 | 104 | 9.79 |
| Gregory Vorsanger | 2 | 92 | 4.26 |
| Vladimir Braverman | 3 | 357 | 34.36 |
| Vyas Sekar | 4 | 3535 | 182.12 |