On the public citation graph

Runs based traffic estimator (RATE): a simple, memory efficient scheme for per-flow rate estimation

0 signed · 61 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/9780470316436openalex-snapshot
Linear Statistical Inference and its Applications
inferredcites →https://doi.org/10.1007/978-1-4757-6283-9openalex-snapshot
Probability Approximations via the Poisson Clumping Heuristic
inferredcites →https://doi.org/10.1109/90.929850openalex-snapshot
Deriving traffic demands for operational IP networks: methodology and experience
inferredcites →https://doi.org/10.1109/glocom.1999.832484openalex-snapshot
Inter-AS traffic patterns and their implications
inferredcites →https://doi.org/10.1109/infcom.1999.752153openalex-snapshot
SRED: stabilized RED
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/tnet.2002.801399openalex-snapshot
The BLUE active queue management algorithms
inferredcites →https://doi.org/10.1145/347057.347555openalex-snapshot
Trajectory sampling for direct traffic observation
inferredcites →https://doi.org/10.1145/347059.347555openalex-snapshot
Trajectory sampling for direct traffic observation
inferredcites →https://doi.org/10.1145/505202.505212openalex-snapshot
New directions in traffic measurement and accounting
inferredcites →https://doi.org/10.1145/505202.505232openalex-snapshot
Charging from sampled network usage
inferredcites →https://doi.org/10.1145/633025.633056openalex-snapshot
New directions in traffic measurement and accounting
inferredcites →https://doi.org/10.2307/1905668openalex-snapshot
An Introduction to Probability Theory and Its Applications

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-1-4614-4851-8_2openalex-snapshot
Per-Flow Size Estimators
inferred← citeshttps://doi.org/10.1007/978-3-540-72709-5_5openalex-snapshot
Beyond CHOKe: Stateless Fair Queueing
inferred← citeshttps://doi.org/10.1007/978-3-540-72709-5_6openalex-snapshot
How Expensive Is Link Utilization?
inferred← citeshttps://doi.org/10.1007/978-3-540-79232-1_7openalex-snapshot
Packet Sampling for Flow Accounting: Challenges and Limitations
inferred← citeshttps://doi.org/10.1007/978-3-540-88623-5_25openalex-snapshot
A Space-Efficient Fair Packet Sampling Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-04190-7_19openalex-snapshot
The Poisson Cluster Process Runs as a Model for the Internet Traffic
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/s11067-006-9001-8openalex-snapshot
Optimal Measurement-based Pricing for an M/M/1 Queue
inferred← citeshttps://doi.org/10.1007/s11432-010-0053-5openalex-snapshot
Identifying heavy hitters in high-speed network monitoring
inferred← citeshttps://doi.org/10.1016/j.comcom.2010.02.014openalex-snapshot
Trading link utilization for queueing delays: An adaptive approach
inferred← citeshttps://doi.org/10.1016/j.comcom.2014.12.003openalex-snapshot
Identifying elephant flows in internet backbone traffic with bloom filters and LRU
inferred← citeshttps://doi.org/10.1016/j.comnet.2010.06.018openalex-snapshot
Sequential hashing: A flexible approach for unveiling significant patterns in high speed networks
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.1109/icacte.2010.5579142openalex-snapshot
REFI: Extracting out heavy-hitter flows accurately and rapidly
inferred← citeshttps://doi.org/10.1109/icisc.2017.8068656openalex-snapshot
ESRATE: Extreme state-ranked based traffic estimation of workload factoring for cloud computing
inferred← citeshttps://doi.org/10.1109/icnp.2004.1348123openalex-snapshot
Real-time detection of hidden traffic patterns
inferred← citeshttps://doi.org/10.1109/infcom.2004.1354587openalex-snapshot
Space-code bloom filter for efficient per-flow traffic measurement
inferred← citeshttps://doi.org/10.1109/infcom.2005.1498484openalex-snapshot
Fast, mernory-efficient traffic estimation by coincidence counting
inferred← citeshttps://doi.org/10.1109/infcom.2007.207openalex-snapshot
Sampled Based Estimation of Network Traffic Flow Characteristics
inferred← citeshttps://doi.org/10.1109/infcom.2007.220openalex-snapshot
A Fast and Compact Method for Unveiling Significant Patterns in High Speed Networks
inferred← citeshttps://doi.org/10.1109/infcom.2009.5062217openalex-snapshot
An Efficient Algorithm for Measuring Medium- to Large-Sized Flows in Network Traffic
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/infcom.2012.6195742openalex-snapshot
Weighted fair queuing with differential dropping
inferred← citeshttps://doi.org/10.1109/infocom.2006.278openalex-snapshot
Content Based Rate Estimation Using Lazy Membership Testing
inferred← citeshttps://doi.org/10.1109/infocom.2006.324openalex-snapshot
Simple and Accurate Identification of High-Rate Flows by Packet Sampling
inferred← citeshttps://doi.org/10.1109/jsac.2006.884032openalex-snapshot
Space-Code Bloom Filter for Efficient Per-Flow Traffic Measurement
inferred← citeshttps://doi.org/10.1109/nss.2010.31openalex-snapshot
Monitoring Heavy-Hitter Flows in High-Speed Network Concurrently
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.2007.900385openalex-snapshot
Fast, Memory Efficient Flow Rate Estimation Using Runs
inferred← citeshttps://doi.org/10.1109/tnet.2010.2066987openalex-snapshot
ProgME: Towards Programmable Network MEasurement
inferred← citeshttps://doi.org/10.1109/tnet.2012.2192447openalex-snapshot
Per-Flow Traffic Measurement Through Randomized Counter Sharing
inferred← citeshttps://doi.org/10.1109/tnsm.2013.122313.130448openalex-snapshot
Proactive Workload Management in Hybrid Cloud Computing
inferred← citeshttps://doi.org/10.1109/tnsm.2022.3149734openalex-snapshot
Monitoring OpenFlow Virtual Networks via Coordinated Switch-Based Traffic Mirroring
inferred← citeshttps://doi.org/10.1109/tpds.2010.104openalex-snapshot
Active Queue Management for Flow Fairness and Stable Queue Length
inferred← citeshttps://doi.org/10.1145/1005686.1005699openalex-snapshot
Flow sampling under hard resource constraints
inferred← citeshttps://doi.org/10.1145/1005686.1005707openalex-snapshot
ACCEL-RATE
inferred← citeshttps://doi.org/10.1145/1012888.1005699openalex-snapshot
Flow sampling under hard resource constraints
inferred← citeshttps://doi.org/10.1145/1282380.1282392openalex-snapshot
ProgME
inferred← citeshttps://doi.org/10.1145/1282427.1282392openalex-snapshot
ProgME
inferred← citeshttps://doi.org/10.1145/1477942.1477958openalex-snapshot
A programmable architecture for scalable and real-time network traffic measurements
inferred← citeshttps://doi.org/10.1145/1815396.1815504openalex-snapshot
Traffic classification techniques supporting semantic networks
inferred← citeshttps://doi.org/10.1145/3225058.3225078openalex-snapshot
Cache Assisted Randomized Sharing Counters in Network Measurement
inferred← citeshttps://doi.org/10.1214/088342304000000206openalex-snapshot
Sampling for Passive Internet Measurement: A Review
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.5555/1251086.1251094openalex-snapshot
Optimal combination of sampled network measurements
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.