Space-code bloom filter for efficient per-flow traffic measurement

No abstract is available for this paper.

• Publication year

  2004

• Venue

  IEEE INFOCOM 2004

• Publication date

  2004-03-07

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1109/INFCOM.2004.1354587
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• ACCEL-RATE: a faster mechanism for memory efficient per-flow traffic estimation

  2004cited by this paper
• Runs based traffic estimator (RATE): a simple, memory efficient scheme for per-flow rate estimation

  2004cited by this paper
• Network Applications of Bloom Filters: A Survey

  2004cited by this paper
• Bitmap algorithms for counting active flows on high speed links

  2003cited by this paper
• An approach to alleviate link overload as observed on an IP backbone

  2003cited by this paper
• A simple algorithm for finding frequent elements in streams and bags

  2003cited by this paper
• Spectral bloom filters

  2003cited by this paper
• Gigascope: a stream database for network applications

  2003cited by this paper
• Packet-level traffic measurements from the Sprint IP backbone

  2003cited by this paper
• Frequency Estimation of Internet Packet Streams with Limited Space

  2002cited by this paper
• Finding frequent items in data streams

  2002cited by this paper
• New directions in traffic measurement and accounting

  2002cited by this paper
• New directions in traffic measurement and accounting

  2002cited by this paper
• Charging from sampled network usage

  2001cited by this paper
• Summary cache: a scalable wide-area web cache sharing protocol

  2000cited by this paper
• A 50-Gb/s IP router

  1998cited by this paper
• The space complexity of approximating the frequency moments

  1996cited by this paper
• Randomized algorithms

  1995cited by this paper
• Mathematical Statistics: Basic Ideas and Selected Topics

  1977cited by this paper
• Space/time trade-offs in hash coding with allowable errors

  1970influential reference
• Mathematical Statistics

  1944cited by this paper
• and as an in

  year unknowncited by this paper
• Proceedings of the 5th Symposium on Operating Systems Design and Implementation Integrated Resource Management for Cluster-based Internet Services

  year unknowncited by this paper

• DistJoin: A Decoupled Join Cardinality Estimator Based on Adaptive Neural Predicate Modulation

  2025cites this paper
• Decoding Errors in Difference-Invertible Bloom Filters: Analysis and Resolution

  2024cites this paper
• Finding recently persistent flows in high-speed packet streams based on cuckoo filter

  2023cites this paper
• Duet: Efficient and Scalable Hybrid Neural Relation Understanding

  2023cites this paper
• Privacy-Preserving Record Linkage for Cardinality Counting

  2023cites this paper
• PISketch: Finding Persistent and Infrequent Flows

  2022cites this paper
• BunchBloomer: Cost-Effective Bloom Filter Accelerator for Genomics Applications

  2022cites this paper
• Accurately Identify Time-decaying Heavy Hitters by Decay-aware Cuckoo Filter along Kicking Path

  2022cites this paper
• Hardware-oriented optimization of Bloom filter algorithms and architectures for ultra-high-speed lookups in network applications

  2022cites this paper
• Efficient and Privacy-Preserving Infection Control System for Covid-19-Like Pandemics Using Blockchain

  2021cites this paper
• Secure user authentication mechanism for IoT-enabled Wireless Sensor Networks based on multiple Bloom filters

  2021cites this paper
• A novel spread estimation based abnormal flow detection in high-speed networks

  2021cites this paper
• Spatial Sketch Configuration for Traffic Measurement in Software Defined Networks

  2021cites this paper
• Distributed SCFMBF Based Protocol for Integrity In Cloud Storage System (DPICS)

  2020cites this paper
• Proactive Forensics in IoT: Privacy-Aware Log-Preservation Architecture in Fog-Enabled-Cloud Using Holochain and Containerization Technologies

  2020cites this paper
• Improved streaming quotient filter: a duplicate detection approach for data streams

  2020cites this paper
• Role of Bloom Filter in Analysis of Big Data

  2020cites this paper
• Algorithm Based on LL_CBF for Large Flows Identification

  2020cites this paper
• Stable learned bloom filters for data streams

  2020cites this paper
• Traffic identification algorithm based on improved LRU

  2020cites this paper
• A survey of sketches in traffic measurement: Design, Optimization, Application and Implementation

  2020cites this paper
• SketchFlow: Per-Flow Systematic Sampling Using Sketch Saturation Event

  2020cites this paper
• Multiple Set Matching with Bloom Matrix and Bloom Vector

  2020cites this paper
• Online Spread Estimation with Non-duplicate Sampling

  2020cites this paper
• Sketch for traffic measurement: design, optimization, application and implementation

  2020cites this paper
• Fast and Accurate Traffic Measurement With Hierarchical Filtering

  2020cites this paper
• Novel Bloom filter algorithms and architectures for ultra-high-speed network security applications

  2020cites this paper
• Identification of Skype Covert Channels using Sketches in SDNs

  2019influential citation
• Generalized Sketch Families for Network Traffic Measurement

  2019cites this paper
• The Tandem Counting Bloom Filter - It Takes Two Counters to Tango

  2019cites this paper
• Space-Efficient Per-Flow Network Traffic Measurement in SDN Environments

  2019influential citation
• HeavyKeeper: An Accurate Algorithm for Finding Top- $k$ Elephant Flows

  2019cites this paper
• A Cuckoo Filter Modification Inspired by Bloom Filter

  2019cites this paper
• Cuckoo Counter: A Novel Framework for Accurate Per-Flow Frequency Estimation in Network Measurement

  2019cites this paper
• Multiple Set Matching and Pre-Filtering with Bloom Multifilters

  2019cites this paper
• Performance Analysis of Duplicate Record Detection Techniques

  2019cites this paper
• InstaMeasure: Instant Per-flow Detection Using Large In-DRAM Working Set of Active Flows

  2019cites this paper
• Bloofi Representation for Item/User in Recommender Systems

  2019cites this paper
• Ultra-Fast Bloom Filters using SIMD Techniques

  2019cites this paper
• Backgrounds of Searchable Storage

  2019cites this paper
• PBloofi: An Enhanced Version of BloofI in Recommender Systems

  2018cites this paper
• Identification of heavy hitters for network data streams with probabilistic sketch

  2018cites this paper
• Accurate and Communication-Efficient Detection of Widespread Events

  2018cites this paper
• CLEF : Limiting the Damage Caused by Large Flows in the Internet Core ( Technical Report )

  2018cites this paper
• Routing Perturbation for Traffic Matrix Evaluation in a Segment Routing Network

  2018cites this paper
• CountMax: A Lightweight and Cooperative Sketch Measurement for Software-Defined Networks

  2018cites this paper
• Memory-Compact Membership Lookup for Multiple Data Sets by a Single Bloom Filter

  2018cites this paper
• Highly Compact Virtual Active Counters for Per-flow Traffic Measurement

  2018cites this paper
• CLEF : Limiting the Damage Caused by Large Flows in the Internet Core

  2018cites this paper
• CLEF: Limiting the Damage Caused by Large Flows in the Internet Core (Technical Report)

  2018cites this paper
• Low Computational Cost Bloom Filters

  2018cites this paper
• Counter Tree: A Scalable Counter Architecture for Per-Flow Traffic Measurement

  2017influential citation
• A Survey: Optimal Node Routing Layouts in MANET

  2017influential citation
• Frequent traffic flow identification through probabilistic bloom filter and its GPU-based acceleration

  2017influential citation
• Scalable Certificate Revocation Schemes for Smart Grid AMI Networks Using Bloom Filters

  2017cites this paper
• Integrity and confidentiality preservation in cloud

  2017cites this paper
• Efficient Bloom filter for network protocols using AES instruction set

  2017cites this paper
• Per-flow counting for big network data stream over sliding windows

  2017cites this paper
• A Platform for Large-Scale Regional IoT Networks

  2017cites this paper
• Scalable software-defined networking through hybrid switching

  2017cites this paper
• One Memory Access Sketch: A More Accurate and Faster Sketch for Per-Flow Measurement

  2017cites this paper
• Per-Flow Size Measurement

  2017cites this paper
• Cardinality Estimation: An Experimental Survey

  2017cites this paper
• Recyclable Counter With Confinement for Real-Time Per-Flow Measurement

  2016influential citation
• Cuckoo Hashing을 이용한 RCC에 대한 성능향상

  2016cites this paper
• Towards Zero-Time Wakeup of Line Cards in Power-Aware Routers

  2016cites this paper
• Hash Table with Expanded-Key for High-Speed Networking

  2016cites this paper
• Towards Building Forensics Enabled Cloud Through Secure Logging-as-a-Service

  2016cites this paper
• A space-and-time efficient technique for big data security analytics

  2016cites this paper
• Authentication Protocols for Internet of Things: A Comprehensive Survey

  2016cites this paper
• Bloom Filter Tree for Fast Search and Synchronization of Tree-Structured Data

  2016cites this paper
• Accurate and Efficient Per-Flow Latency Measurement Without Probing and Time Stamping

  2016cites this paper
• Distinct-Values Estimation over Data Streams

  2016cites this paper
• Highly Compact Virtual Counters for Per-Flow Traffic Measurement through Register Sharing

  2016cites this paper
• Efficient Customized Privacy Preserving Friend Discovery in Mobile Social Networks

  2015cites this paper
• Secure cloud computing: Data integrity, assured deletion, and measurement-based anomaly detection

  2015cites this paper
• Efficient Histogram Estimation for Smart Grid Data Processing With the Loglog-Bloom-Filter

  2015influential citation
• One-hashing bloom filter

  2015cites this paper
• Identifying frequent flows in large datasets through probabilistic bloom filters

  2015influential citation
• Bloom Filter Tree for Fast Search in Tree-Structured Data

  2015cites this paper
• Counter Tree: A Scalable Counter Architecture for Per-Flow Traffic Measurement

  2015influential citation
• Optimal Skampling for the Flow Size Distribution

  2015cites this paper
• Traffic Analysis on High-Speed Internet Links

  2014cites this paper
• Identifying Frequent Flows in Large Traffic Sets through Probabilistic Bloom Filters

  2014cites this paper
• Key technologies of network traffic measurement

  2014cites this paper
• Efficient data structures and protocols with applications in space-time constrained systems

  2014cites this paper
• Towards zero-time wakeup of line cards in power-aware routers

  2014cites this paper
• Noise can help: accurate and efficient per-flow latency measurement without packet probing and time stamping

  2014cites this paper
• Reducing False Positives of a Bloom Filter using Cross-Checking Bloom Filters

  2014cites this paper
• Highly compact virtual maximum likelihood sketches for counting big network data

  2014cites this paper
• An IP Traceback Protocol using a Compressed Hash Table, a Sinkhole Router and Data Mining based on Network Forensics against Network Attacks

  2014cites this paper
• Towards line-speed and accurate on-line popularity monitoring on NDN routers

  2014cites this paper
• Fast Bloom Filters and Their Generalization

  2014cites this paper
• An efficient certificate revocation scheme for large-scale AMI networks

  2014cites this paper
• Bloom tree: A search tree based on Bloom filters for multiple-set membership testing

  2014cites this paper
• Achieving Energy Efficiency on Networking Systems with Optimization Algorithms and Compressed Data Structures

  2014influential citation
• Advanced Algorithms for Efficient Approximate Duplicate Detection in Data Streams Using Bloom Filters

  2014cites this paper
• Scalable algorithms for estimating flow length distributions from sampled data

  2014cites this paper
• Asymmetric Sparse Bloom Filter

  2014cites this paper
• A Unified Unicast and Multicast Routing and Forwarding Algorithm for Software-Defined Datacenter Networks

  2013cites this paper