Frequency Estimation of Internet Packet Streams with Limited Space

No abstract is available for this paper.

• Publication year

  2002

• Venue

  Embedded Systems and Applications

• Publication date

  2002-09-17

• Fields of study

  Mathematics, Computer Science, Engineering

• Identifiers
  DOI 10.1007/3-540-45749-6_33
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Finding frequent items in data streams

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

  2002influential reference
• Abstract The

  2002cited by this paper
• Maintaining Stream Statistics over Sliding Windows

  2002cited by this paper
• Maintaining stream statistics over sliding windows: (extended abstract)

  2002cited by this paper
• Controlling high-bandwidth flows at the congested router

  2001cited by this paper
• Trajectory sampling for direct traffic observation

  2001cited by this paper
• Testing and Spot-Checking of Data Streams

  2000cited by this paper
• Stable distributions, pseudorandom generators, embeddings and data stream computation

  2000cited by this paper
• Testing and spot-checking of data streams (extended abstract)

  2000cited by this paper
• Packet classification on multiple fields

  1999cited by this paper
• An Approximate Lp Difference Algorithm for Massive Data Streams

  1999cited by this paper
• The nature of the beast: Recent traffic measurements from an Internet backbone

  1998cited by this paper
• Computing Iceberg Queries Efficiently

  1998cited by this paper
• Random sampling for histogram construction: how much is enough?

  1998cited by this paper
• New sampling-based summary statistics for improving approximate query answers

  1998cited by this paper
• Sampling-Based Estimation of the Number of Distinct Values of an Attribute

  1995cited by this paper
• Randomized algorithms

  1995cited by this paper
• A linear-time probabilistic counting algorithm for database applications

  1990cited by this paper
• Probabilistic Counting Algorithms for Data Base Applications

  1985cited by this paper
• Approximate counting: A detailed analysis

  1985cited by this paper
• Optimum algorithms for two random sampling problems

  1983cited by this paper
• Finding a Majority Among N Votes.

  1982cited by this paper
• Counting large numbers of events in small registers

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

  1970cited by this paper
• An Introduction to Probability Theory and Its Applications

  1959cited by this paper
• An Introduction to Probability Theory and its Applications

  1958cited by this paper
• Probability and Statistical Inference

  1956cited by this paper

• Continuous software monitoring backed by process mining: a systematic literature review

  2026cites this paper
• Accurate Super Spreader Identification With Non-Duplicate Samplers in Data Streams

  2026cites this paper
• PipHeap: Approximate Heap in the Pipeline Empowering Network Measurement

  2025cites this paper
• SoK: Systematizing a Decade of Architectural RowHammer Defenses Through the Lens of Streaming Algorithms

  2025cites this paper
• Approaching 100% Confidence in Stream Summary through ReliableSketch

  2025cites this paper
• Indexing Strings with Utilities

  2025cites this paper
• Tight Bounds for Heavy-Hitters and Moment Estimation in the Sliding Window Model

  2025cites this paper
• The Adaptive Use of Count-Min Sketch: What is Safe and What is Not?

  2025cites this paper
• HSS: A Memory-Efficient, Accurate, and Fast Network Measurement Framework in Sliding Windows

  2024cites this paper
• HeavyCache: A Generic Sketch for Summarizing Data Streams

  2024cites this paper
• A Unified Framework for Mining Batch and Periodic Batch in Data Streams

  2024cites this paper
• QPOPSS: Query and Parallelism Optimized Space-Saving for Finding Frequent Stream Elements

  2024cites this paper
• An Evaluation of Software Frequency Sketches

  2024cites this paper
• Approaching 100% Confidence in Stream Summary through ReliableSketch

  2024cites this paper
• The SpaceSaving± Family of Algorithms for Data Streams with Bounded Deletions

  2023cites this paper
• Exact and Approximate Range Mode Query Data Structures in Practice

  2023cites this paper
• A Sketch Framework for Approximate Data Stream Processing in Sliding Windows

  2023cites this paper
• ChainSketch: An Efficient and Accurate Sketch for Heavy Flow Detection

  2023cites this paper
• Improved Frequency Estimation Algorithms with and without Predictions

  2023cites this paper
• Streaming Lower Bounds and Asymmetric Set-Disjointness

  2023cites this paper
• An Evaluation of Software Sketches

  2023cites this paper
• HyperCalm Sketch: One-Pass Mining Periodic Batches in Data Streams

  2023influential citation
• Panakos: Chasing the Tails for Multidimensional Data Streams

  2023cites this paper
• Efficient Algorithm for Deterministic Search of Hot Elements

  2022cites this paper
• Efficient Resource-Constrained Monitoring

  2022cites this paper
• UA-Sketch: An Accurate Approach to Detect Heavy Flow based on Uninterrupted Arrival

  2022influential citation
• Deterministic, Fast and Accurate Solution of the Heavy Hitters q-Tail Latencies Problem

  2022cites this paper
• Tracking Where Events Take Place: Reverse Spatial Term Queries on Streaming Data

  2022cites this paper
• Light Agents Searching for Hot Information

  2022cites this paper
• SQUID: Faster Analytics via Sampled Quantile Estimation

  2022cites this paper
• ProTRR: Principled yet Optimal In-DRAM Target Row Refresh

  2022cites this paper
• The Complexity of the Co-Occurrence Problem

  2022cites this paper
• Separations for Estimating Large Frequency Moments on Data Streams

  2021cites this paper
• A simple proof of a new set disjointness with applications to data streams

  2021cites this paper
• HSS: Faster and More Accurate Sliding Sketch by Using Half Fields

  2021cites this paper
• On the Practical Detection of Heavy Hitter Flows

  2021cites this paper
• Data stream fusion for accurate quantile tracking and analysis

  2021cites this paper
• Fast Approximation of the Top-k Items in Data Streams Using a Reconfigurable Accelerator

  2021cites this paper
• FPGA/GPU-based Acceleration for Frequent Itemsets Mining: A Comprehensive Review

  2021influential citation
• SpaceSaving± An Optimal Algorithm for Frequency Estimation and Frequent items in the Bounded Deletion Model

  2021cites this paper
• Frequent Elements with Witnesses in Data Streams

  2021cites this paper
• Rethinking Fine-Grained Measurement From Software-Defined Perspective: A Survey

  2021influential citation
• DAP-Sketch: An accurate and effective network measurement sketch with Deterministic Admission Policy

  2021cites this paper
• Towards a Cost vs. Quality Sweet Spot for Monitoring Networks

  2021cites this paper
• An Efficient Hardware Architecture for Finding Frequent Items in Data Streams

  2020cites this paper
• Extracting Keywords on SNS by Successive KeyGraph

  2020cites this paper
• Faking Elephant Flows on the Count Min Sketch

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

  2020cites this paper
• Sliding Sketches: A Framework using Time Zones for Data Stream Processing in Sliding Windows

  2020cites this paper
• BitMatrix: A Multipurpose Sketch for Monitoring of Multi-tenant Networks

  2020cites this paper
• Ranking and benchmarking framework for sampling algorithms on synthetic data streams

  2020cites this paper
• Timely Reporting of Heavy Hitters using External Memory

  2020cites this paper
• Mining Robust Frequent Items in Data Streams

  2020cites this paper
• Thresholded Monitoring in Distributed Data Streams

  2020cites this paper
• Approaching Optimal Duplicate Detection in a Sliding Window

  2020cites this paper
• A situation refinement model for complex event processing

  2020cites this paper
• On Frequency Estimation and Detection of Heavy Hitters in Data Streams

  2020cites this paper
• Routing Oblivious Measurement Analytics

  2020cites this paper
• Frequent Directions for Matrix Sketching with Provable Bounds: A Generalized Approach

  2020cites this paper
• Improving Packet Flow Counting With Fingerprint Counting

  2020cites this paper
• Predictive Intelligence in Analytics Aggregation of Partial Ordered Subsets

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

  2020cites this paper
• Compressed Dynamic Range Majority and Minority Data Structures

  2020cites this paper
• SA Sketch: A self‐adaption sketch framework for high‐speed network

  2020cites this paper
• Faster and More Accurate Measurement through Additive-Error Counters

  2020influential citation
• New Directions in Streaming Algorithms

  2020cites this paper
• Thresholded Monitoring in Distributed Data Streams

  2019cites this paper
• Dynamic Sketch: Efficient and Adjustable Heavy Hitter Detection for Software Packet Processing

  2019cites this paper
• CBFSketch: A Scalable Sketch Framework for High Speed Network

  2019cites this paper
• HeavyKeeper: An Accurate Algorithm for Finding Top- $k$ Elephant Flows

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

  2019cites this paper
• Real-Time & Stream Data Management

  2019cites this paper
• Enumerating Range Modes

  2019cites this paper
• Multi-dimensional Tensor Sketch

  2019cites this paper
• Fast Identification of Heavy Hitters by Cached and Packed Group Testing

  2019cites this paper
• q-MAX: A Unified Scheme for Improving Network Measurement Throughput

  2019cites this paper
• Packet routing analyses using probabilistic data structures in Multi-Tenant Networks based on programmable devices

  2019cites this paper
• CMSS: Sketching based reliable tracking of large network flows

  2019cites this paper
• Top-K Frequent Term Queries on Streaming Data

  2019cites this paper
• Mining Frequent Items Over the Distributed Hierarchical Continuous Weighted Data Streams in Internet of Things

  2019cites this paper
• Statistical Algorithmic Profiling for Randomized Approximate Programs

  2019cites this paper
• Randomized Admission Policy for Efficient Top-k, Frequency, and Volume Estimation

  2019cites this paper
• Higher-Order Count Sketch: Dimensionality Reduction that Retains Efficient Tensor Operations

  2019cites this paper
• Generalized Sketch Families for Network Traffic Measurement

  2019cites this paper
• Accurate Network Flow Measurement with Deterministic Admission Policy

  2019cites this paper
• Data Stream Management

  2019cites this paper
• Process mining with streaming data

  2019cites this paper
• Scalable Push-Based Real-Time Queries on Top of Pull-Based Databases

  2019cites this paper
• Efficiently Inferring Top-k Elephant Flows based on Discrete Tensor Completion

  2019cites this paper
• Identifying Optimal Parameters for Approximate Randomized Algorithms

  2019cites this paper
• Advanced Technology and Social Media Influence on Research, Industry and Community

  2018cites this paper
• Incremental TextRank - Automatic Keyword Extraction for Text Streams

  2018cites this paper
• Big Data Methods for Efficient Network Monitoring

  2018influential citation
• Parallel Mining of Correlated Heavy Hitters on Distributed and Shared-Memory Architectures

  2018cites this paper
• Spatio-temporal top-k term search over sliding window

  2018cites this paper
• Parallel Mining of Correlated Heavy Hitters

  2018cites this paper
• HeavyGuardian: Separate and Guard Hot Items in Data Streams

  2018cites this paper
• Mining frequent items in unstructured P2P networks

  2018cites this paper
• The Online Event-Detection Problem

  2018cites this paper
• Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows

  2018cites this paper