Network measurement remains a missing piece in today's software packet processing
platforms. Sketches provide a promising building block for filling this void by monitoring …

Abstract Methods for Approximate Query Processing (AQP) are essential for dealing with
massive data. They are often the only means of providing interactive response times when …

Network measurement is challenged to fulfill stringent resource requirements in the face of
massive network traffic. While approximate measurement can trade accuracy for resource …

The frequent items problem is to process a stream of items and find all items occurring more
than a given fraction of the time. It is one of the most heavily studied problems in data stream …

Fast detection of heavy flows (eg, heavy hitters and heavy changers) in massive network
traffic is challenging due to the stringent requirements of fast packet processing and limited …

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

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 …

Superspreaders (ie, hosts with numerous distinct connections) remain severe threats to
production networks. How to accurately detect superspreaders in real-time at scale remains …

We describe a synopsis structure, the Difference Digest, that allows two nodes to compute
the elements belonging to the set difference in a single round with communication overhead …

Sketch algorithms have been extensively studied in the area of network measurement, given
their limited resource usage and theoretically bounded errors. However, error bounds …