A survey on sliding window sketch for network measurement

Z Zeng, L Cui, M Qian, Z Zhang, K Wei - Computer Networks, 2023 - Elsevier
As an important basis for network management, effective network measurement is critical for
improving network performance and security. As an efficient tool for network measurement …

Sampling for passive internet measurement: A review

N Duffield - 2004 - projecteuclid.org
Sampling has become an integral part of passive network measurement. This role is driven
by the need to control the consumption of resources in the measurement infrastructure under …

DevoFlow: Scaling flow management for high-performance networks

AR Curtis, JC Mogul, J Tourrilhes… - Proceedings of the …, 2011 - dl.acm.org
OpenFlow is a great concept, but its original design imposes excessive overheads. It can
simplify network and traffic management in enterprise and data center environments …

Data streams: Algorithms and applications

S Muthukrishnan - Foundations and Trends® in Theoretical …, 2005 - nowpublishers.com
In the data stream scenario, input arrives very rapidly and there is limited memory to store
the input. Algorithms have to work with one or few passes over the data, space less than …

Efficient computation of frequent and top-k elements in data streams

A Metwally, D Agrawal, A El Abbadi - International conference on …, 2005 - Springer
We propose an integrated approach for solving both problems of finding the most popular k
elements, and finding frequent elements in a data stream. Our technique is efficient and …

C-SPARQL: a continuous query language for RDF data streams

DF Barbieri, D Braga, S Ceri, ED Valle… - … Journal of Semantic …, 2010 - World Scientific
This article defines C-SPARQL, an extension of SPARQL whose distinguishing feature is the
support of continuous queries, ie queries registered over RDF data streams and then …

Frequent directions: Simple and deterministic matrix sketching

M Ghashami, E Liberty, JM Phillips… - SIAM Journal on …, 2016 - SIAM
We describe a new algorithm called FrequentDirections for deterministic matrix sketching in
the row-update model. The algorithm is presented an arbitrary input matrix A ∈ R^ n * d one …

Cold filter: A meta-framework for faster and more accurate stream processing

Y Zhou, T Yang, J Jiang, B Cui, M Yu, X Li… - Proceedings of the 2018 …, 2018 - dl.acm.org
Approximate stream processing algorithms, such as Count-Min sketch, Space-Saving, etc.,
support numerous applications in databases, storage systems, networking, and other …

Stingy sketch: a sketch framework for accurate and fast frequency estimation

H Li, Q Chen, Y Zhang, T Yang, B Cui - Proceedings of the VLDB …, 2022 - dl.acm.org
Recording the frequency of items in highly skewed data streams is a fundamental and hot
problem in recent years. The literature demonstrates that sketch is the most promising …

[PDF][PDF] New streaming algorithms for fast detection of superspreaders.

S Venkataraman, DX Song, PB Gibbons… - NDSS, 2005 - reports-archive.adm.cs.cmu.edu
High-speed monitoring of Internet traffic is an important and challenging problem, with
applications to real-time attack detection and mitigation, traffic engineering, etc. However …