Premium
SA Sketch: A self‐adaption sketch framework for high‐speed network
Author(s) -
Zhu Haiting,
Zhang Yuan,
Zhang Lu,
He Gaofeng,
Liu Linfeng,
Liu Ning
Publication year - 2020
Publication title -
concurrency and computation: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.309
H-Index - 67
eISSN - 1532-0634
pISSN - 1532-0626
DOI - 10.1002/cpe.5891
Subject(s) - sketch , computer science , bloom filter , sketch recognition , space (punctuation) , throughput , artificial intelligence , data mining , computer network , algorithm , telecommunications , operating system , gesture recognition , gesture , wireless
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.