Bitmap Algorithms for Counting Active Flows on High-Speed Links

No abstract is available for this paper.

• Publication year

  2006

• Venue

  IEEE/ACM Transactions on Networking

• Publication date

  2006-10-01

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1109/TNET.2006.882836
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A robust system for accurate real-time summaries of internet traffic

  2005cited by this paper
• New Streaming Algorithms for Fast Detection of Superspreaders

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

  2004cited by this paper
• Loglog Counting of Large Cardinalities (Extended Abstract)

  2003cited by this paper
• Core-stateless fair queueing: a scalable architecture to approximate fair bandwidth allocations in high-speed networks

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

  2003influential reference
• Practical automated detection of stealthy portscans

  2002cited by this paper
• Properties and prediction of flow statistics from sampled packet streams

  2002cited by this paper
• Congestion control for high bandwidth-delay product networks

  2002cited by this paper
• Controlling high bandwidth aggregates in the network

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

  2002cited by this paper
• The architecture of CoralReef: an Internet traffic monitoring software suite

  2001influential reference
• FlowScan: A Network Traffic Flow Reporting and Visualization Tool

  2000influential reference
• Snort - Lightweight Intrusion Detection for Networks

  1999influential reference
• Inter-AS traffic patterns and their implications

  1999cited by this paper
• Resampling for wireless access

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

  1990influential reference
• Probabilistic Counting Algorithms for Data Base Applications

  1985influential reference
• Universal Classes of Hash Functions

  1979cited by this paper

• Enhancing Accuracy for Super Spreader Identification in High-Speed Data Streams

  2024cites this paper
• An Accurate and Invertible Sketch for Super Spread Detection

  2024cites this paper
• Distinct Elements in Streams: An Algorithm for the (Text) Book

  2023cites this paper
• MSLCFinder: An Algorithm in Limited Resources Environment for Finding Top-k Elephant Flows

  2022cites this paper
• Tree sketch: An accurate and memory-efficient sketch for network-wide measurement

  2022cites this paper
• Virtual self-adaptive bitmap for online cardinality estimation

  2022cites this paper
• ExtendedHyperLogLog: Analysis of a new Cardinality Estimator

  2021cites this paper
• DegreeSketch: Distributed Cardinality Sketches on Massive Graphs with Applications

  2020cites this paper
• Efficient Online Classification and Tracking on Resource-constrained IoT Devices

  2020cites this paper
• Security of HyperLogLog (HLL) Cardinality Estimation: Vulnerabilities and Protection

  2020cites this paper
• Information theoretic limits of cardinality estimation: Fisher meets Shannon

  2020cites this paper
• An Efficient K-Persistent Spread Estimator for Traffic Measurement in High-Speed Networks

  2020cites this paper
• Estimating Cardinality for Arbitrarily Large Data Stream With Improved Memory Efficiency

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

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

  2020cites this paper
• Fast Updates for Line-Rate HyperLogLog-Based Cardinality Estimation

  2020cites this paper
• Cardinality estimation using Gumbel distribution

  2020cites this paper
• Analytical Confidence Intervals for the Number of Different Objects in Data Streams

  2019cites this paper
• Persistent Traffic Measurement through Vehicle-to-Infrastructure Communications in Cyber-Physical Road Systems

  2019cites this paper
• Optimal Streaming and Tracking Distinct Elements with High Probability

  2018cites this paper
• Enabling in-network aggregation by diffusion units for urban scale M2M networks

  2017cites this paper
• Cardinality Estimation for Elephant Flows: A Compact Solution Based on Virtual Register Sharing

  2017cites this paper
• Detection of Super Nodes for Network Data Streams with Filtering Strategy

  2017cites this paper
• Better with fewer bits: Improving the performance of cardinality estimation of large data streams

  2017cites this paper
• Per-Flow Cardinality Measurement

  2017cites this paper
• Persistent Spread Measurement

  2017cites this paper
• Sketch-guided filtering support for detecting superspreaders in high-speed networks

  2016cites this paper
• An SRAM-based novel hardware architecture for longest prefix matching for IP route lookup

  2016cites this paper
• LRU-LC: Fast Estimating Cardinality of Flows over Sliding Windows

  2016cites this paper
• A resilient buffer allocation scheme in active queue management: a stochastic cooperative game theoretic approach

  2015cites this paper
• Cardinality Estimation Meets Good-Turing

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

  2015cites this paper
• A Survey on Software-Defined Networking

  2015cites this paper
• Performance Degradation Detection of Virtual Machines Via Passive Measurement and Machine Learning

  2014cites this paper
• High-Speed Network Traffic Measurement Method

  2014cites this paper
• An online framework for flow round trip time measurement

  2013cites this paper
• Per-Flow Size Estimators

  2012cites this paper
• Transformation-based parallelization of request-processing applications

  2010cites this paper
• Secure and highly-available aggregation queries in large-scale sensor networks via set sampling

  2009cites this paper
• Order statistics and estimating cardinalities of massive data sets

  2009influential citation
• On the evaluation of recommender systems with recorded interactions

  2009cites this paper
• Dynamic Wavelength Allocation in IP/WDM Metro Access Networks

  2008cites this paper
• A Effective Algorithm for Counting Active Flows Based on Loop Bloom Filter

  2008influential citation
• Sampling for Passive Internet Measurement: A Review

  2004cites this paper