To refer to this page use:
|Abstract:||Network administrators constantly monitor network traffic for congestion and attacks. They need to perform a large number of measurements on the traffic simultaneously, to detect different types of anomalies such as heavy hitters or super-spreaders. Existing techniques often focus on a single statistic (e.g., traffic volume) or traffic attribute (e.g., destination IP). However, performing numerous heterogeneous measurements within the constrained memory architecture of modern network devices poses significant challenges, due to the limited number of memory accesses allowed per packet. We propose BeauCoup, a system based on the coupon collector problem, that supports multiple distinct counting queries simultaneously while making only a small constant number of memory accesses per packet. We implement BeauCoup on PISA commodity programmable switches, satisfying the strict memory size and access constraints while using a moderate portion of other data-plane hardware resources. Evaluations show BeauCoup achieves the same accuracy as other sketch-based or sampling-based solutions using 4x fewer memory access.|
|Citation:||Chen, Xiaoqi, Shir Landau-Feibish, Mark Braverman, and Jennifer Rexford. "BeauCoup: Answering Many Network Traffic Queries, One Memory Update at a Time." In Proceedings of the Annual Conference of the ACM Special Interest Group on Data Communication on the Applications, Technologies, Architectures, and Protocols for Computer Communication (2020): pp. 226-239. doi:10.1145/3387514.3405865|
|Pages:||226 - 239|
|Type of Material:||Conference Article|
|Journal/Proceeding Title:||Proceedings of the Annual Conference of the ACM Special Interest Group on Data Communication on the Applications, Technologies, Architectures, and Protocols for Computer Communication|
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.