On the public citation graph

Identifying Elephant Flows Using a Reversible MultiLayer Hashed Counting Bloom Filter

0 signed · 29 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.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/hoti.2007.13openalex-snapshot
ElephantTrap: A low cost device for identifying large flows
inferredcites →https://doi.org/10.1109/infcom.2009.5061958openalex-snapshot
Robust Counting Via Counter Braids: An Error-Resilient Network Measurement Architecture
inferredcites →https://doi.org/10.1109/infcom.2010.5461921openalex-snapshot
High-Speed Per-Flow Traffic Measurement with Probabilistic Multiplicity Counting
inferredcites →https://doi.org/10.1109/infcom.2011.5934979openalex-snapshot
Fast and compact per-flow traffic measurement through randomized counter sharing
inferredcites →https://doi.org/10.1109/infocom.2008.71openalex-snapshot
MultiLayer Compressed Counting Bloom Filters
inferredcites →https://doi.org/10.1109/inm.2007.374825openalex-snapshot
Finding Elephant flows for optical networks
inferredcites →https://doi.org/10.1109/jsac.2006.884032openalex-snapshot
Space-Code Bloom Filter for Efficient Per-Flow Traffic Measurement
inferredcites →https://doi.org/10.1109/mnet.2012.6135850openalex-snapshot
Probabilistic parallel measurement of network traffic at multiple locations
inferredcites →https://doi.org/10.1109/tcomm.2011.112311.100622openalex-snapshot
ANLS: Adaptive Non-Linear Sampling Method for Accurate Flow Size Measurement
inferredcites →https://doi.org/10.1109/tnet.2005.852874openalex-snapshot
Estimating flow distributions from sampled flow statistics
inferredcites →https://doi.org/10.1109/tnet.2009.2020799openalex-snapshot
POPI: A User-Level Tool for Inferring Router Packet Forwarding Priority
inferredcites →https://doi.org/10.1145/1028788.1028803openalex-snapshot
Identifying elephant flows through periodically sampled packets
inferredcites →https://doi.org/10.1145/1341431.1341433openalex-snapshot
Probabilistic lossy counting
inferredcites →https://doi.org/10.1145/1375457.1375472openalex-snapshot
Counter braids
inferredcites →https://doi.org/10.1145/637201.637242openalex-snapshot
Observed structure of addresses in IP traffic
inferredcites →https://doi.org/10.1145/859716.859719openalex-snapshot
New directions in traffic measurement and accounting
inferredcites →https://doi.org/10.1145/872785.872787openalex-snapshot
Spectral bloom filters

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/nem.1987openalex-snapshot
An adaptive approach for elephant flow detection with the rapidly changing traffic in data center network
inferred← citeshttps://doi.org/10.1007/978-981-19-5845-8_41openalex-snapshot
Overview of Data Center Link Load Balancing Technology Based on SDN
inferred← citeshttps://doi.org/10.1007/978-981-97-0210-7_39openalex-snapshot
Bias-Resilient Elephant Flow Detection in Distributed SDNs Through Federated Learning
inferred← citeshttps://doi.org/10.1007/s12065-023-00902-7openalex-snapshot
Elephant flow detection intelligence for software-defined networks: a survey on current techniques and future direction
inferred← citeshttps://doi.org/10.1016/j.jnca.2017.03.006openalex-snapshot
Frequent traffic flow identification through probabilistic bloom filter and its GPU-based acceleration
inferred← citeshttps://doi.org/10.1109/access.2020.2987977openalex-snapshot
Flow-Aware Elephant Flow Detection for Software-Defined Networks
inferred← citeshttps://doi.org/10.1109/access.2023.3272894openalex-snapshot
Traffic Classification in IP Networks Through Machine Learning Techniques in Final Systems
inferred← citeshttps://doi.org/10.1109/glocom.2014.7037145openalex-snapshot
Elephant flow detection in datacenters using OpenFlow-based Hierarchical Statistics Pulling
inferred← citeshttps://doi.org/10.1109/ispa-bdcloud-socialcom-sustaincom59178.2023.00167openalex-snapshot
Link load balancing scheme for elephant flow in SDN data center
inferred← citeshttps://doi.org/10.1109/iwqos.2015.7404747openalex-snapshot
Identifying frequent flows in large datasets through probabilistic bloom filters
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.