4.5 Article

Randomized Error Removal for Online Spread Estimation in High-Speed Networks

Related references

Note: Only part of the references are listed.
Article Computer Science, Hardware & Architecture

Fast and Accurate Cardinality Estimation by Self-Morphing Bitmaps

Haibo Wang et al.

Summary: This paper proposes a self-morphing bitmap as a new solution for estimating the cardinality of a data stream. It combines operational simplicity with structural dynamics, automatically adapting to different stream sizes. The theoretical and experimental evaluation demonstrates its significant improvement over previous techniques.

IEEE-ACM TRANSACTIONS ON NETWORKING (2022)

Article Computer Science, Hardware & Architecture

Super Spreader Identification Using Geometric-Min Filter

Chaoyi Ma et al.

Summary: The paper introduces a new super-spreader monitor that can identify over 99% of flows spreading greater than a user-specified threshold with a low memory requirement, by introducing a generalized geometric hash function, a generalized geometric counter, and a novel geometric-min filter to focus on identifying super spreaders while filtering out most small/medium flows.

IEEE-ACM TRANSACTIONS ON NETWORKING (2022)

Article Computer Science, Hardware & Architecture

Virtual Filter for Non-Duplicate Sampling With Network Applications

Chaoyi Ma et al.

Summary: This study presents a non-duplicate sampling approach for handling mismatch between the line rate and throughput of a network traffic measurement module. The proposed virtual filter design reduces processing and memory overhead and includes a mechanism for automatically adjusting the sampling probability.

IEEE-ACM TRANSACTIONS ON NETWORKING (2022)

Article Computer Science, Hardware & Architecture

Routing-Oblivious Network-Wide Measurements

Ran Ben-Basat et al.

Summary: Recent introduction of SDN enables the deployment of new centralized network algorithms that significantly enhance network operations. This research proposes novel algorithms for fundamental network-wide measurement problems without making assumptions on the topology and routing, or modifying the underlying traffic. An extensive evaluation on realistic network topologies and traces demonstrates that the proposed algorithms outperform existing works in terms of accuracy within reasonable space constraints.

IEEE-ACM TRANSACTIONS ON NETWORKING (2021)

Proceedings Paper Computer Science, Hardware & Architecture

Noise Measurement and Removal for Data Streaming Algorithms with Network Applications

Chaoyi Ma et al.

Summary: The paper investigates the error property in data streaming algorithms and introduces methods to reduce estimation errors by measuring noise. By introducing concepts like d-smallest noise and artificial data items, and proposing four noise measurement methods, the paper successfully decreases estimation errors based on mathematical analysis and experimental results with real network traces.

2021 IFIP NETWORKING CONFERENCE AND WORKSHOPS (IFIP NETWORKING) (2021)

Article Computer Science, Information Systems

Randomized Error Removal for Online Spread Estimation in Data Streaming

Haibo Wang et al.

Summary: This paper introduces new designs for multi-flow spread estimation that incur smaller processing and query overhead compared to existing technologies, while achieving significant accuracy improvements in spread estimation. The experimental results show that the best sketch significantly outperforms the best existing work in terms of estimation accuracy, data item processing throughput, and online query throughput.

PROCEEDINGS OF THE VLDB ENDOWMENT (2021)

Proceedings Paper Computer Science, Hardware & Architecture

SpreadSketch: Toward Invertible and Network-Wide Detection of Superspreaders

Lu Tang et al.

IEEE INFOCOM 2020 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (2020)

Proceedings Paper Computer Science, Theory & Methods

NitroSketch: Robust and General Sketch-based Monitoring in Software Switches

Zaoxing Liu et al.

SIGCOMM '19 - PROCEEDINGS OF THE ACM SPECIAL INTEREST GROUP ON DATA COMMUNICATION (2019)

Article Computer Science, Hardware & Architecture

Generalized Sketch Families for Network Traffic Measurement

You Zhou et al.

PROCEEDINGS OF THE ACM ON MEASUREMENT AND ANALYSIS OF COMPUTING SYSTEMS (2019)

Proceedings Paper Computer Science, Theory & Methods

Elastic Sketch: Adaptive and Fast Network-wide Measurements

Tong Yang et al.

PROCEEDINGS OF THE 2018 CONFERENCE OF THE ACM SPECIAL INTEREST GROUP ON DATA COMMUNICATION (SIGCOMM '18) (2018)

Proceedings Paper Computer Science, Information Systems

Cold Filter: A Meta-Framework for Faster and More Accurate Stream Processing

Yang Zhou et al.

SIGMOD'18: PROCEEDINGS OF THE 2018 INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA (2018)

Proceedings Paper Computer Science, Theory & Methods

SketchVisor: Robust Network Measurement for Soft ware Packet Processing

Qun Huang et al.

SIGCOMM '17: PROCEEDINGS OF THE 2017 CONFERENCE OF THE ACM SPECIAL INTEREST GROUP ON DATA COMMUNICATION (2017)

Proceedings Paper Computer Science, Theory & Methods

One Sketch to Rule Them All: Rethinking Network Flow Monitoring with UnivMon

Zaoxing Liu et al.

PROCEEDINGS OF THE 2016 ACM CONFERENCE ON SPECIAL INTEREST GROUP ON DATA COMMUNICATION (SIGCOMM '16) (2016)

Article Computer Science, Information Systems

Processing a Trillion Cells per Mouse Click

Alexander Hall et al.

PROCEEDINGS OF THE VLDB ENDOWMENT (2012)

Article Computer Science, Information Systems

An Overview of IP Flow-Based Intrusion Detection

Anna Sperotto et al.

IEEE COMMUNICATIONS SURVEYS AND TUTORIALS (2010)

Article Computer Science, Hardware & Architecture

Bitmap algorithms for counting active flows on high-speed links

Cristian Estan et al.

IEEE-ACM TRANSACTIONS ON NETWORKING (2006)

Article Computer Science, Information Systems

A taxonomy of DDoS attack and DDoS Defense mechanisms

J Mirkovic et al.

ACM SIGCOMM COMPUTER COMMUNICATION REVIEW (2004)