Frequent traffic flow identification through probabilistic bloom filter and its GPU-based acceleration

No abstract is available for this paper.

• Publication year

  2017

• Venue

  Journal of Network and Computer Applications

• Publication date

  2017-06-01

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1016/j.jnca.2017.03.006
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• CASE: Cache-assisted stretchable estimator for high speed per-flow measurement

  2016cited by this paper
• Identifying elephant flows in internet backbone traffic with bloom filters and LRU

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

  2015influential reference
• Streaming Solutions for Fine-Grained Network Traffic Measurements and Analysis

  2014cited by this paper
• Data summarization for network traffic monitoring

  2014cited by this paper
• Pegasus: Precision hunting for icebergs and anomalies in network flows

  2013cited by this paper
• An efficient hybrid approach to per-flow state tracking for high-speed networks

  2013cited by this paper
• Elephant Flows Identification Based on Dynamic Multiple Filters Algorithm

  2013cited by this paper
• Leveraging Zipf's law for traffic offloading

  2012cited by this paper
• Per-Flow Traffic Measurement Through Randomized Counter Sharing

  2012cited by this paper
• Identifying Elephant Flows Using a Reversible MultiLayer Hashed Counting Bloom Filter

  2012cited by this paper
• Approximate Frequency Counts over Data Streams

  2012cited by this paper
• Theory and Practice of Bloom Filters for Distributed Systems

  2012cited by this paper
• Bloom Filter Performance on Graphics Engines

  2011cited by this paper
• A Parallel Algorithm for Error Correction in High-Throughput Short-Read Data on CUDA-Enabled Graphics Hardware

  2010cited by this paper
• GPU support for batch oriented workloads

  2009influential reference
• Frequent items in streaming data: An experimental evaluation of the state-of-the-art

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

  2008cited by this paper
• Space-Code Bloom Filter for Efficient Per-Flow Traffic Measurement

  2006cited by this paper
• Efficient Computation of Frequent and Top-k Elements in Data Streams

  2005cited by this paper
• Time-decaying Bloom Filters for data streams with skewed distributions

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

  2004cited by this paper
• What's new: finding significant differences in network data streams

  2004cited by this paper
• An improved data stream summary: the count-min sketch and its applications

  2004cited by this paper
• Space-code bloom filter for efficient per-flow traffic measurement

  2004influential reference
• A simple algorithm for finding frequent elements in streams and bags

  2003cited by this paper
• Dynamically maintaining frequent items over a data stream

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

  2003cited by this paper
• New directions in traffic measurement and accounting: Focusing on the elephants, ignoring the mice

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

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

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

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

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

  2000cited by this paper
• A primer in game theory

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

  1970cited by this paper

• Bloom Filters at Fifty: From Probabilistic Foundations to Modern Engineering and Applications

  2025cites this paper
• A Clustered Link-Prediction SEIRS Model with Temporal Node Activation for Modeling Computer Virus Propagation in Urban Communication Systems

  2025cites this paper
• Variable-length Encoding Framework: A Generic Framework for Enhancing the Accuracy of Approximate Membership Queries

  2023cites this paper
• Hunting the pertinency of hash and bloom filter combinations on GPU for fast pattern matching

  2022cites this paper
• A survey on the roles of Bloom Filter in implementation of the Named Data Networking

  2021cites this paper
• Towards threshold‐agnostic heavy‐hitter classification

  2021cites this paper
• Comparison on Search Failure between Hash Tables and a Functional Bloom Filter

  2020cites this paper
• A modified neuro-fuzzy classifier and its parallel implementation on modern GPUs for real time intrusion detection

  2019cites this paper
• Probabilistic data structure-based community detection and storage scheme in online social networks

  2019cites this paper
• ProIDS: Probabilistic Data Structures Based Intrusion Detection System for Network Traffic Monitoring

  2017cites this paper
• Bloom filter based optimization scheme for massive data handling in IoT environment

  2017cites this paper