Nitrosketch: robust and general sketch-based monitoring in software switches
Zaoxing Liu,Ran Ben-Basat,Gil Einziger,Yaron Kassner,Vladimir Braverman,Roy Friedman,Vyas Sekar +6 more
- pp 334-350
Reads0
Chats0
TLDR
The design and implementation of NitroSketch is presented, a sketching framework that systematically addresses the performance bottlenecks of sketches without sacrificing robustness and generality and is implemented on three popular software platforms.Abstract:
Software switches are emerging as a vital measurement vantage point in many networked systems. Sketching algorithms or sketches, provide high-fidelity approximate measurements, and appear as a promising alternative to traditional approaches such as packet sampling. However, sketches incur significant computation overhead in software switches. Existing efforts in implementing sketches in virtual switches make sacrifices on one or more of the following dimensions: performance (handling 40 Gbps line-rate packet throughput with low CPU footprint), robustness (accuracy guarantees across diverse workloads), and generality (supporting various measurement tasks). In this work, we present the design and implementation of NitroSketch, a sketching framework that systematically addresses the performance bottlenecks of sketches without sacrificing robustness and generality. Our key contribution is the careful synthesis of rigorous, yet practical solutions to reduce the number of per-packet CPU and memory operations. We implement NitroSketch on three popular software platforms (Open vSwitch-DPDK, FD.io-VPP, and BESS) and evaluate the performance. We show that accuracy is comparable to unmodified sketches while attaining up to two orders of magnitude speedup, and up to 45% reduction in CPU usage.read more
Citations
More filters
An improved data stream summary: The Count-Min Sketch and its applications
Graham Cormode,S. Muthukrishnan +1 more
TL;DR: In this paper, the authors introduce a sublinear space data structure called the countmin sketch for summarizing data streams, which allows fundamental queries in data stream summarization such as point, range, and inner product queries to be approximately answered very quickly; in addition it can be applied to solve several important problems in data streams such as finding quantiles, frequent items, etc.
Proceedings ArticleDOI
BeauCoup: Answering Many Network Traffic Queries, One Memory Update at a Time
TL;DR: BeauCoup is 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, and achieves the same accuracy as other sketch-based or sampling-based solutions using 4x fewer memory access.
Proceedings ArticleDOI
Flow Event Telemetry on Programmable Data Plane
Yu Zhou,Chen Sun,Hongqiang Harry Liu,Rui Miao,Shi Bai,Bo Li,Zhilong Zheng,Lingjun Zhu,Zhen Shen,Yongqing Xi,Pengcheng Zhang,Dennis Cai,Ming Zhang,Mingwei Xu +13 more
TL;DR: This paper presents NetSeer, a flow event telemetry (FET) monitor which aims to discover and record all performance-critical data plane events, e.g. packet drops, congestion, path change, and packet pause, and can reduce NPA mitigation time by 61%-99% with only 0.01% overhead of monitoring traffic.
Journal ArticleDOI
Designing Heavy-Hitter Detection Algorithms for Programmable Switches
TL;DR: This work introduces PRECISION, an algorithm that uses Partial Recirculation to find top flows on a programmable switch and achieves higher accuracy than previous heavy hitter detection algorithms that avoid recirculation, and suggests two algorithms for the hierarchical heavy hitters detection problem.
Posted Content
Privacy for Free: Communication-Efficient Learning with Differential Privacy Using Sketches
TL;DR: This work proves that Count Sketch, a simple method for data stream summarization, has inherent differential privacy properties and proposes a novel sketch-based framework (DiffSketch) for distributed learning, where the transmitted messages via sketches are compressed to simultaneously achieve communication efficiency and provable privacy benefits.
References
More filters
Book
Probability: Theory and Examples
TL;DR: In this paper, a comprehensive introduction to probability theory covering laws of large numbers, central limit theorem, random walks, martingales, Markov chains, ergodic theorems, and Brownian motion is presented.
Proceedings ArticleDOI
Network traffic characteristics of data centers in the wild
TL;DR: An empirical study of the network traffic in 10 data centers belonging to three different categories, including university, enterprise campus, and cloud data centers, which includes not only data centers employed by large online service providers offering Internet-facing applications but also data centers used to host data-intensive (MapReduce style) applications.
Journal ArticleDOI
An improved data stream summary: the count-min sketch and its applications
Graham Cormode,S. Muthukrishnan +1 more
TL;DR: In this paper, the authors introduce a sublinear space data structure called the countmin sketch for summarizing data streams, which allows fundamental queries in data stream summarization such as point, range, and inner product queries to be approximately answered very quickly; in addition it can be applied to solve several important problems in data streams such as finding quantiles, frequent items, etc.
Journal ArticleDOI
Anomaly-based network intrusion detection: Techniques, systems and challenges
TL;DR: The main challenges to be dealt with for the wide scale deployment of anomaly-based intrusion detectors, with special emphasis on assessment issues are outlined.