HSS: A Memory-Efficient, Accurate, and Fast Network Measurement Framework in Sliding Windows

Network measurement is indispensable to network management. This paper focuses on three fundamental network measurement tasks: membership query, frequency query, and heavy hitter query. Existing solutions, such as sketches, sliding window algorithms, and the Sliding Sketch framework, struggle to sim...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE eTransactions on network and service management Ročník 21; číslo 6; s. 5958 - 5976
Hlavní autoři: Hang, Zijun, Wang, Yongjie, Lu, Yuliang
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.12.2024
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Accuracy
Algorithms
Arrays
Control and data plane programmability
data stream processing
Frequency measurement
Load management
Memory management
Memory tasks
network measurement
Queries
Real time operation
Real-time systems
sketch
Sketches
Sliding
sliding window
Software defined networking
ISSN:1932-4537, 1932-4537
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Network measurement is indispensable to network management. This paper focuses on three fundamental network measurement tasks: membership query, frequency query, and heavy hitter query. Existing solutions, such as sketches, sliding window algorithms, and the Sliding Sketch framework, struggle to simultaneously achieve memory efficiency, accuracy, real-time operation, and generic application. Accordingly, this paper proposes the Half Sliding Sketch (HSS), an improvement over the state-of-the-art Sliding Sketch framework. The HSS framework is applied to five contemporary sketches for the three aforementioned query tasks. Theoretical analysis reveals that our framework is faster, more memory-efficient and more accurate than the state-of-the-art Sliding Sketch while still being generic. Extensive experimental results reveal that HSS significantly enhances the accuracy for the three query tasks, achieving improvements of <inline-formula> <tex-math notation="LaTeX">2\times </tex-math></inline-formula> to <inline-formula> <tex-math notation="LaTeX">28.7\times </tex-math></inline-formula>, <inline-formula> <tex-math notation="LaTeX">1.5\times </tex-math></inline-formula> to <inline-formula> <tex-math notation="LaTeX">9\times </tex-math></inline-formula>, and <inline-formula> <tex-math notation="LaTeX">2.4\times </tex-math></inline-formula> to <inline-formula> <tex-math notation="LaTeX">3.6\times </tex-math></inline-formula>, respectively. Moreover, in terms of speed, HSS is <inline-formula> <tex-math notation="LaTeX">1.2\times </tex-math></inline-formula> to <inline-formula> <tex-math notation="LaTeX">1.5\times </tex-math></inline-formula> faster than the Sliding Sketch.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1932-4537
1932-4537
DOI:10.1109/TNSM.2024.3460751