Related references
Note: Only part of the references are listed.Spread Estimation With Non-Duplicate Sampling in High-Speed Networks
He Huang et al.
IEEE-ACM TRANSACTIONS ON NETWORKING (2021)
Noise Measurement and Removal for Data Streaming Algorithms with Network Applications
Chaoyi Ma et al.
2021 IFIP NETWORKING CONFERENCE AND WORKSHOPS (IFIP NETWORKING) (2021)
Virtual Filter for Non-duplicate Sampling
Chaoyi Ma et al.
2021 IEEE 29TH INTERNATIONAL CONFERENCE ON NETWORK PROTOCOLS (ICNP 2021) (2021)
Randomized Error Removal for Online Spread Estimation in Data Streaming
Haibo Wang et al.
PROCEEDINGS OF THE VLDB ENDOWMENT (2021)
Online Spread Estimation with Non-duplicate Sampling
Yu-E Sun et al.
IEEE INFOCOM 2020 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (2020)
SpreadSketch: Toward Invertible and Network-Wide Detection of Superspreaders
Lu Tang et al.
IEEE INFOCOM 2020 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (2020)
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)
Generalized Sketch Families for Network Traffic Measurement
You Zhou et al.
PROCEEDINGS OF THE ACM ON MEASUREMENT AND ANALYSIS OF COMPUTING SYSTEMS (2019)
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)
Sketch Learn: Relieving User Burdens in Approximate Measurement with Automated Statistical Inference
Qun Huang et al.
PROCEEDINGS OF THE 2018 CONFERENCE OF THE ACM SPECIAL INTEREST GROUP ON DATA COMMUNICATION (SIGCOMM '18) (2018)
Cardinality Estimation for Elephant Flows: A Compact Solution Based on Virtual Register Sharing
Qingjun Xiao et al.
IEEE-ACM TRANSACTIONS ON NETWORKING (2017)
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)
Identifying High-Cardinality Hosts from Network-Wide Traffic Measurements
Yang Liu et al.
IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING (2016)
Detection of Superpoints Using a Vector Bloom Filter
Weijiang Liu et al.
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY (2016)
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)
Bitmap algorithms for counting active flows on high-speed links
Cristian Estan et al.
IEEE-ACM TRANSACTIONS ON NETWORKING (2006)
An improved data stream summary: The count-min sketch and its applications
G Cormode et al.
LATIN 2004: THEORETICAL INFORMATICS (2004)
Deriving traffic demands for operational IP networks: Methodology and experience
A Feldmann et al.
IEEE-ACM TRANSACTIONS ON NETWORKING (2001)
Share Paper
