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...
Saved in:
Published in | Concurrency and computation Vol. 32; no. 23 |
---|---|
Main Authors | , , , , , |
Format | Journal Article |
Language | English |
Published |
Hoboken
Wiley Subscription Services, Inc
10.12.2020
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
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. |
---|---|
Bibliography: | Funding information National Natural Science Foundation of China, 61502250; 61702282; 61802207; 61872191; 71801123; Natural Science Foundation of the Jiangsu Higher Education Institutions of China, 17KJB520023; NUPTSF, NY214188 |
ISSN: | 1532-0626 1532-0634 |
DOI: | 10.1002/cpe.5891 |