Recording the frequency of items in highly skewed data streams is a fundamental and hot
problem in recent years. The literature demonstrates that sketch is the most promising …

Approximate stream processing algorithms, such as Count-Min sketch, Space-Saving, etc.,
support numerous applications in databases, storage systems, networking, and other …

Sketch algorithms have been widely deployed for network measurement as they achieve
high accuracy with restricted resource usage. They store measurement results compactly in …

Counters are the fundamental building block of many data sketching schemes, which hash
items to a small number of counters and account for collisions to provide good …

Network measurement probes the underlying network to support upper-level decisions such
as network management, network update, network maintenance, network defense and …

Heavy-hitter detection is a fundamental task in network traffic measurement and security.
Existing work faces the dilemma of suffering dynamic and imbalanced traffic characteristics …

Network measurement plays a critical role in numerous network applications that rely on
fundamental flow processing tasks such as frequency estimation, heavy hitter detection, and …

Sketch is a probabilistic data structure widely used in various fields due to its high accuracy
under small memory. Designing hierarchical data structures for real-world datasets with high …

Sketch as a probability data structure has been widely used in high volume, fast data
streams. At the cost of a tiny accuracy in frequency estimation, it achieves a high speed with …

Sketch is a probabilistic data structure, and is widely used for per-flow measurement in
network. The most common sketches are the CM sketch and its several variants. However …