SA Sketch: A self‐adaption sketch framework for high‐speed network. (16th June 2020)

• Record Type: Journal Article
• Authors: Zhu, Haiting; Zhang, Yuan; Zhang, Lu; He, Gaofeng; Liu, Linfeng; Liu, Ning
• Other Names: Xu Zheng guestEditor.; Zhou Qingyuan guestEditor.; Dong Fang guestEditor.; Yong Jianming guestEditor.; Fei Xiang guestEditor.
• Is Part Of: Concurrency and computation. Volume 32:Number 23(2020)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2020-06-16
• Subjects: traffic measurement -- data stream technology -- sketch -- bloom filter -- space utilization; Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.5891
• Languages: English
• ISSNs: 1532-0626

Abstract

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.