On the public citation graph
Simple and Accurate Identification of High-Rate Flows by Packet Sampling
0 signed · 56 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-45307-5_32openalex-snapshot
Identifying Long-Term High-Bandwidth Flows at a Router
inferredcites →https://doi.org/10.1109/90.793002openalex-snapshot
Promoting the use of end-to-end congestion control in the Internet
inferredcites →https://doi.org/10.1109/icnp.2001.992899openalex-snapshot
Controlling high-bandwidth flows at the congested router
inferredcites →https://doi.org/10.1109/infcom.2000.832269openalex-snapshot
CHOKe - a stateless active queue management scheme for approximating fair bandwidth allocation
inferredcites →https://doi.org/10.1109/infcom.2004.1354587openalex-snapshot
Space-code bloom filter for efficient per-flow traffic measurement
inferredcites →https://doi.org/10.1109/infcom.2004.1354591openalex-snapshot
Runs based traffic estimator (RATE): a simple, memory efficient scheme for per-flow rate estimation
inferredcites →https://doi.org/10.1109/infcom.2005.1498484openalex-snapshot
Fast, mernory-efficient traffic estimation by coincidence counting
inferredcites →https://doi.org/10.1109/infocom.2006.324openalex-snapshot
Simple and Accurate Identification of High-Rate Flows by Packet Sampling
inferredcites →https://doi.org/10.1109/tnet.2002.801399openalex-snapshot
The BLUE active queue management algorithms
inferredcites →https://doi.org/10.1145/1028788.1028803openalex-snapshot
Identifying elephant flows through periodically sampled packets
inferredcites →https://doi.org/10.1145/505202.505212openalex-snapshot
New directions in traffic measurement and accounting
inferredcites →https://doi.org/10.1145/633025.633055openalex-snapshot
On the characteristics and origins of internet flow rates
inferredcites →https://doi.org/10.1145/633025.633056openalex-snapshot
New directions in traffic measurement and accounting
inferredcites →https://doi.org/10.1145/637201.637225openalex-snapshot
Properties and prediction of flow statistics from sampled packet streams
inferredcites →https://doi.org/10.1145/964725.633055openalex-snapshot
On the characteristics and origins of internet flow rates
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-319-47340-6_2openalex-snapshot
Per-Flow Size Measurement
inferred← citeshttps://doi.org/10.1007/978-3-642-23544-3_32openalex-snapshot
Mining Approximate Frequent Closed Flows over Packet Streams
inferred← citeshttps://doi.org/10.1007/s10922-014-9336-2openalex-snapshot
A Network Management System for Handling Scientific Data Flows
inferred← citeshttps://doi.org/10.1007/s10922-020-09556-7openalex-snapshot
BitMatrix: A Multipurpose Sketch for Monitoring of Multi-tenant Networks
inferred← citeshttps://doi.org/10.1016/j.comnet.2012.10.018openalex-snapshot
Autonomic load balancing of flow monitors
inferred← citeshttps://doi.org/10.1016/j.future.2018.11.006openalex-snapshot
Understanding flows in high-speed scientific networks: A Netflow data study
inferred← citeshttps://doi.org/10.1016/j.jnca.2018.05.004openalex-snapshot
A survey on network data collection
inferred← citeshttps://doi.org/10.1109/cmc.2009.47openalex-snapshot
Finding the Most Balanced Delay Constrained Path
inferred← citeshttps://doi.org/10.1109/comst.2024.3488580openalex-snapshot
Online Network DoS/DDoS Detection: Sampling, Change Point Detection, and Machine Learning Methods
inferred← citeshttps://doi.org/10.1109/hpcc.and.euc.2013.280openalex-snapshot
Finding Heavy-Hitter by Periodically Deleting Small Flows
inferred← citeshttps://doi.org/10.1109/icc.2012.6363789openalex-snapshot
Autonomic load balancing for flow monitoring
inferred← citeshttps://doi.org/10.1109/icccn.2007.4317840openalex-snapshot
Efficient Timeout Checking Mechanism for Traffic Control
inferred← citeshttps://doi.org/10.1109/iccee.2008.90openalex-snapshot
Finding Heavy Hitters by Packet Count Flow Sampling
inferred← citeshttps://doi.org/10.1109/iccet.2010.5486097openalex-snapshot
Identifying high-rate flows based on Bayesian single sampling
inferred← citeshttps://doi.org/10.1109/icdcs.2019.00202openalex-snapshot
InstaMeasure: Instant Per-flow Detection Using Large In-DRAM Working Set of Active Flows
inferred← citeshttps://doi.org/10.1109/icect.2009.97openalex-snapshot
Detection Based on Per-flow Packet Count and Entropy
inferred← citeshttps://doi.org/10.1109/icnp.2015.15openalex-snapshot
Counter Tree: A Scalable Counter Architecture for Per-Flow Traffic Measurement
inferred← citeshttps://doi.org/10.1109/icpads53394.2021.00044openalex-snapshot
An Efficient Adaptive Noise Correction Framework for Size Measurement over Data Streams
inferred← citeshttps://doi.org/10.1109/infcom.2007.305openalex-snapshot
Simple and Adaptive Identification of Superspreaders by Flow Sampling
inferred← citeshttps://doi.org/10.1109/infcom.2011.5934979openalex-snapshot
Fast and compact per-flow traffic measurement through randomized counter sharing
inferred← citeshttps://doi.org/10.1109/infocom.2018.8485804openalex-snapshot
Highly Compact Virtual Active Counters for Per-flow Traffic Measurement
inferred← citeshttps://doi.org/10.1109/nfv-sdn.2017.8169833openalex-snapshot
A high-speed cheetah flow identification network function (CFINF)
inferred← citeshttps://doi.org/10.1109/pccc.2010.5682303openalex-snapshot
Mnemonic Lossy Counting: An efficient and accurate heavy-hitters identification algorithm
inferred← citeshttps://doi.org/10.1109/tnet.2012.2192447openalex-snapshot
Per-Flow Traffic Measurement Through Randomized Counter Sharing
inferred← citeshttps://doi.org/10.1109/tnet.2016.2514523openalex-snapshot
Recyclable Counter With Confinement for Real-Time Per-Flow Measurement
inferred← citeshttps://doi.org/10.1109/tnet.2016.2621159openalex-snapshot
Counter Tree: A Scalable Counter Architecture for Per-Flow Traffic Measurement
inferred← citeshttps://doi.org/10.1109/tnet.2021.3108033openalex-snapshot
Super Spreader Identification Using Geometric-Min Filter
inferred← citeshttps://doi.org/10.1109/tnsm.2011.020411.00017openalex-snapshot
Efficient Network Modification to Improve QoS Stability at Failures
inferred← citeshttps://doi.org/10.1145/1655925.1656116openalex-snapshot
TCP portscan detection based on single packet flows and entropy
inferred← citeshttps://doi.org/10.1145/3225058.3225078openalex-snapshot
Cache Assisted Randomized Sharing Counters in Network Measurement
inferred← citeshttps://doi.org/10.1587/transinf.e93.d.1162openalex-snapshot
Identifying High-Rate Flows Based on Sequential Sampling
inferred← citeshttps://doi.org/10.18130/v3fq0kopenalex-snapshot
Traffic Engineering and Characterization of High-Rate Large-Sized Flows
inferred← citeshttps://doi.org/10.18130/v3k80bopenalex-snapshot
Traffic Engineering in Packet/Circuit Hybrid Networks
inferred← citeshttps://doi.org/10.3745/ktccs.2013.2.10.421openalex-snapshot
Flow Labeling Method for Realtime Detection of Heavy Traffic Sources
showing the first 36 of 37 · page through all 37
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.