SA Sketch: A self‐adaption sketch framework for high‐speed network

Summary Sketch is a compact data structure used to summarize data streams. It is widely used in the measurement of network traffic, and its accuracy is higher than traditional methods. Currently, there are some typical sketches: Count‐Min Sketch, CU Sketch, and Count Sketch. According to the charact...

Full description

Saved in:
Bibliographic Details
Published in:Concurrency and computation 2020-12, Vol.32 (23), p.n/a
Main Authors: Zhu, Haiting, Zhang, Yuan, Zhang, Lu, He, Gaofeng, Liu, Linfeng, Liu, Ning
Format: Article
Language:English
Subjects:
bloom filter
Communications traffic
data stream technology
Data structures
Data transmission
sketch
Sketches
space utilization
traffic measurement
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Summary Sketch is a compact data structure used to summarize data streams. It is widely used in the measurement of network traffic, and its accuracy is higher than traditional methods. Currently, there are some typical sketches: Count‐Min Sketch, CU Sketch, and Count Sketch. According to the characteristics of network traffic, we propose a new sketch framework called Self‐Adaption Sketch, which is combined Sketch with Bloom Filter. In the framework, the sketch is created dynamically and the memory space is adjusted timely according to the network traffic by using the concept carrying. Our experiment results showed that the space utilization and accuracy are significantly improved while the throughput of self‐adaption sketch is maintained at a relatively good level.
ISSN:1532-0626
1532-0634
DOI:10.1002/cpe.5891