On the public citation graph

A New Bloom Filter Architecture for FIB Lookup in Named Data Networking

0 signed · 45 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.1007/978-3-319-23237-9_22openalex-snapshot
Fragmented-Iterated Bloom Filters for Routing in Distributed Event-Based Sensor Networks
inferredcites →https://doi.org/10.1016/j.comcom.2018.09.001openalex-snapshot
Bitmap-based priority-NPT for packet forwarding at named data network
inferredcites →https://doi.org/10.1016/j.jnca.2015.02.001openalex-snapshot
Information centric network: Research challenges and opportunities
inferredcites →https://doi.org/10.1016/j.jnca.2015.12.009openalex-snapshot
Radient: Scalable, memory efficient name lookup algorithm for named data networking
inferredcites →https://doi.org/10.1016/j.jnca.2016.02.008openalex-snapshot
Name prefix matching using bloom filter pre-searching for content centric network
inferredcites →https://doi.org/10.1016/j.jnca.2016.09.007openalex-snapshot
N-FIB: Scalable, memory efficient name-based forwarding
inferredcites →https://doi.org/10.1016/j.jnca.2017.04.011openalex-snapshot
Cache sharing using bloom filters in named data networking
inferredcites →https://doi.org/10.1080/15427951.2004.10129096openalex-snapshot
Network Applications of Bloom Filters: A Survey
inferredcites →https://doi.org/10.1109/access.2017.2764106openalex-snapshot
Adaptive Compression Trie Based Bloom Filter: Request Filter for NDN Content Store
inferredcites →https://doi.org/10.1109/access.2018.2831259openalex-snapshot
FlameDB: A Key-Value Store With Grouped Level Structure and Heterogeneous Bloom Filter
inferredcites →https://doi.org/10.1109/icdcs.2012.35openalex-snapshot
Scalable Name Lookup in NDN Using Effective Name Component Encoding
inferredcites →https://doi.org/10.1109/lcomm.2015.2478462openalex-snapshot
Complement Bloom Filter for Identifying True Positiveness of a Bloom Filter
inferredcites →https://doi.org/10.1109/lcomm.2016.2624286openalex-snapshot
Ternary Bloom Filter Replacing Counting Bloom Filter
inferredcites →https://doi.org/10.1109/mm.2010.44openalex-snapshot
Tuple Pruning Using Bloom Filters for Packet Classification
inferredcites →https://doi.org/10.1109/netsys.2017.7903945openalex-snapshot
I(FIB)F: Iterated bloom filters for routing in named data networks
inferredcites →https://doi.org/10.1109/surv.2011.031611.00024openalex-snapshot
Theory and Practice of Bloom Filters for Distributed Systems
inferredcites →https://doi.org/10.1109/tc.2010.38openalex-snapshot
Priority Tries for IP Address Lookup
inferredcites →https://doi.org/10.1109/tc.2012.193openalex-snapshot
On Adding Bloom Filters to Longest Prefix Matching Algorithms
inferredcites →https://doi.org/10.1109/tc.2015.2444850openalex-snapshot
New Approach for Efficient IP Address Lookup Using a Bloom Filter in Trie-Based Algorithms
inferredcites →https://doi.org/10.1145/1159913.1159950openalex-snapshot
Beyond bloom filters
inferredcites →https://doi.org/10.1145/1658939.1658941openalex-snapshot
Networking named content
inferredcites →https://doi.org/10.1145/2317307.2317319openalex-snapshot
Adaptive forwarding in named data networking
inferredcites →https://doi.org/10.1145/2656877.2656887openalex-snapshot
Named data networking
inferredcites →https://doi.org/10.1145/348019.348570openalex-snapshot
On-chip vs. off-chip memory
inferredcites →https://doi.org/10.1145/362686.362692openalex-snapshot
Space/time trade-offs in hash coding with allowable errors
inferredcites →https://doi.org/10.3390/app7070700openalex-snapshot
Integrated Optical Content Addressable Memories (CAM) and Optical Random Access Memories (RAM) for Ultra-Fast Address Look-Up Operations
inferredcites →https://doi.org/10.3390/app8010083openalex-snapshot
Silicon Photonics towards Disaggregation of Resources in Data Centers
inferredcites →https://doi.org/10.5370/kiee.2016.65.12.2061openalex-snapshot
IP Address Lookup Algorithm Using a Vectored Bloom Filter

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-981-16-0666-3_15openalex-snapshot
Forwarding Information Base Design Techniques in Content-Centric Networking: A Survey
inferred← citeshttps://doi.org/10.1016/j.comcom.2019.12.029openalex-snapshot
Dual-load Bloom filter: Application for name lookup
inferred← citeshttps://doi.org/10.1016/j.future.2022.01.005openalex-snapshot
An approach for FIB construction and Interest packet forwarding in information centric network
inferred← citeshttps://doi.org/10.1016/j.phycom.2021.101463openalex-snapshot
A named data networking prediction-based mobility solution in space–air–terrestrial networks
inferred← citeshttps://doi.org/10.1109/access.2022.3158368openalex-snapshot
Dynamically Allocated Bloom Filter-Based PIT Architectures
inferred← citeshttps://doi.org/10.1109/hoticn50779.2020.9350810openalex-snapshot
An Efficient Name Look-up Architecture Based on Binary Search in NDN Networking
inferred← citeshttps://doi.org/10.1109/iceccme55909.2022.9988559openalex-snapshot
Towards a Scalable Named Data Border Gateway Protocol
inferred← citeshttps://doi.org/10.1109/iceic69189.2026.11386314openalex-snapshot
Weighted Binary Search Tree to NDN Name Lookup
inferred← citeshttps://doi.org/10.1109/lcomm.2020.3003695openalex-snapshot
Addition of a Secondary Functional Bloom Filter
inferred← citeshttps://doi.org/10.1109/tc.2021.3112079openalex-snapshot
Learned FBF: Learning-Based Functional Bloom Filter for Key-Value Storage
inferred← citeshttps://doi.org/10.1109/tc.2026.3700857openalex-snapshot
PL-FBF: A Partitioned Learned Functional Bloom Filter With Adaptive Memory Allocation for Key–Value Stores
inferred← citeshttps://doi.org/10.1109/tssa56819.2022.10063900openalex-snapshot
Classification of interfaces on Named Data Networking Using machine learning
inferred← citeshttps://doi.org/10.3390/app10155218openalex-snapshot
Comparison on Search Failure between Hash Tables and a Functional Bloom Filter
inferred← citeshttps://doi.org/10.3390/app15084163openalex-snapshot
A Distance-Encoded Bloom Filter for Fast NDN Name Lookup
inferred← citeshttps://doi.org/10.3390/app9214621openalex-snapshot
Vectored-Bloom Filter for IP Address Lookup: Algorithm and Hardware Architectures
inferred← citeshttps://doi.org/10.3991/ijim.v15i07.21149openalex-snapshot
Designing Cuckoo Based Pending Interest Table for CCN Networks
inferred← citeshttps://doi.org/10.7717/peerj-cs.3551openalex-snapshot
Advancing named data networking: a comprehensive survey on naming and packet lookup mechanisms
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.