On the public citation graph
Chisel: A Storage-efficient, Collision-free Hash-based Network Processing Architecture
0 signed · 58 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.1109/35.668286openalex-snapshot
Beyond best effort: router architectures for the differentiated services of tomorrow's Internet
inferredcites →https://doi.org/10.1109/90.851975openalex-snapshot
Summary cache: a scalable wide-area Web cache sharing protocol
inferredcites →https://doi.org/10.1109/infcom.2000.832490openalex-snapshot
Near-optimal routing lookups with bounded worst case performance
inferredcites →https://doi.org/10.1109/infcom.2001.916641openalex-snapshot
Using multiple hash functions to improve IP lookups
inferredcites →https://doi.org/10.1109/infcom.2003.1208657openalex-snapshot
Coolcams: power-efficient TCAMs for forwarding engines
inferredcites →https://doi.org/10.1109/jsac.2003.810507openalex-snapshot
Scalable IP lookup for internet routers
inferredcites →https://doi.org/10.1145/263105.263133openalex-snapshot
Small forwarding tables for fast routing lookups
inferredcites →https://doi.org/10.1145/277851.277863openalex-snapshot
Faster IP lookups using controlled prefix expansion
inferredcites →https://doi.org/10.1145/347057.347565openalex-snapshot
Memory-efficient state lookups with fast updates
inferredcites →https://doi.org/10.1145/362686.362692openalex-snapshot
Space/time trade-offs in hash coding with allowable errors
inferredcites →https://doi.org/10.1145/863977.863979openalex-snapshot
Longest prefix matching using bloom filters
inferredcites →https://doi.org/10.5555/982792.982797openalex-snapshot
The Bloomier filter: an efficient data structure for static support lookup tables
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-540-69903-3_5openalex-snapshot
I/O Efficient Dynamic Data Structures for Longest Prefix Queries
inferred← citeshttps://doi.org/10.1007/s00453-011-9594-2openalex-snapshot
I/O Efficient Dynamic Data Structures for Longest Prefix Queries
inferred← citeshttps://doi.org/10.1016/j.comcom.2010.03.009openalex-snapshot
Hierarchical packet classification using a Bloom filter and rule-priority tries
inferred← citeshttps://doi.org/10.1016/j.jnca.2014.02.007openalex-snapshot
Memory-efficient IP lookup using trie merging for scalable virtual routers
inferred← citeshttps://doi.org/10.1016/j.jnca.2015.12.009openalex-snapshot
Radient: Scalable, memory efficient name lookup algorithm for named data networking
inferred← citeshttps://doi.org/10.1109/date.2010.5456921openalex-snapshot
A memory- and time-efficient on-chip TCAM minimizer for IP lookup
inferred← citeshttps://doi.org/10.1109/fpt.2008.4762368openalex-snapshot
PERG: A scalable FPGA-based pattern-matching engine with consolidated Bloomier filters
inferred← citeshttps://doi.org/10.1109/hoti.2008.27openalex-snapshot
An Efficient Hardware-Based Multi-hash Scheme for High Speed IP Lookup
inferred← citeshttps://doi.org/10.1109/hpsr.2009.5307429openalex-snapshot
FlashLook: 100-Gbps hash-tuned route lookup architecture
inferred← citeshttps://doi.org/10.1109/hpsr52026.2021.9481816openalex-snapshot
CP-Trie: Cumulative PopCount based Trie for IPv6 Routing Table Lookup in Software and ASIC
inferred← citeshttps://doi.org/10.1109/i-span.2009.139openalex-snapshot
Greedy Prefix Cache for IP Routing Lookups
inferred← citeshttps://doi.org/10.1109/icc.2018.8422428openalex-snapshot
Spatially-Dispersed Caching in Information-Centric Networking
inferred← citeshttps://doi.org/10.1109/icnp.2009.5339676openalex-snapshot
A hash-based scalable IP lookup using Bloom and fingerprint filters
inferred← citeshttps://doi.org/10.1109/icnp.2010.5762752openalex-snapshot
Fast routing table lookup based on deterministic multi-hashing
inferred← citeshttps://doi.org/10.1109/icnp.2013.6733607openalex-snapshot
Guided multiple hashing: Achieving near perfect balance for fast routing lookup
inferred← citeshttps://doi.org/10.1109/icns.2007.80openalex-snapshot
Measuring Network Parameters with Hardware Support
inferred← citeshttps://doi.org/10.1109/ihmsc.2016.94openalex-snapshot
Efficient Hashing Technique Based on Bloom Filter for High-Speed Network
inferred← citeshttps://doi.org/10.1109/infcom.2010.5462142openalex-snapshot
FlashTrie: Hash-based Prefix-Compressed Trie for IP Route Lookup Beyond 100Gbps
inferred← citeshttps://doi.org/10.1109/infcom.2011.5935151openalex-snapshot
Offset addressing approach to memory-efficient IP address lookup
inferred← citeshttps://doi.org/10.1109/ipdps.2008.4536275openalex-snapshot
A space- and time-efficient hash table hierarchically indexed by Bloom filters
inferred← citeshttps://doi.org/10.1109/iraniancee.2014.6999700openalex-snapshot
CRTHT: A novel collision-free and storage-efficient hash-based method to find LMP
inferred← citeshttps://doi.org/10.1109/jetcas.2014.2361061openalex-snapshot
A Nonvolatile Associative Memory-Based Context-Driven Search Engine Using 90 nm CMOS/MTJ-Hybrid Logic-in-Memory Architecture
inferred← citeshttps://doi.org/10.1109/jsac.2022.3191351openalex-snapshot
A&B: AI and Block-Based TCAM Entries Replacement Scheme for Routers
inferred← citeshttps://doi.org/10.1109/lcn.2007.154openalex-snapshot
N-Best Optimal Path Ant Routing Algorithm for State-Dependent N Best Quality of service Routes in IP Networks
inferred← citeshttps://doi.org/10.1109/lcn.2007.40openalex-snapshot
Storage-Efficient Architecture for Routing Tables via Prefix Transformation
inferred← citeshttps://doi.org/10.1109/lcn.2013.6761282openalex-snapshot
DHash: A cache-friendly TCP lookup algorithm for fast network processing
inferred← citeshttps://doi.org/10.1109/micro.2006.51openalex-snapshot
Virtually Pipelined Network Memory
inferred← citeshttps://doi.org/10.1109/mnrc.2008.4683370openalex-snapshot
PERG: A scalable pattern-matching accelerator
inferred← citeshttps://doi.org/10.1109/sips.2014.6986075openalex-snapshot
Algorithm and architecture for a multiple-field context-driven search engine using fully-parallel clustered associative memories
inferred← citeshttps://doi.org/10.1109/tc.2012.193openalex-snapshot
On Adding Bloom Filters to Longest Prefix Matching Algorithms
inferred← citeshttps://doi.org/10.1109/tnet.2008.2008646openalex-snapshot
High-Bandwidth Network Memory System Through Virtual Pipelines
inferred← citeshttps://doi.org/10.1109/tnet.2009.2022085openalex-snapshot
SUSE: Superior Storage-Efficiency for Routing Tables Through Prefix Transformation and Aggregation
inferred← citeshttps://doi.org/10.1109/tnet.2011.2167158openalex-snapshot
Concise Lookup Tables for IPv4 and IPv6 Longest Prefix Matching in Scalable Routers
inferred← citeshttps://doi.org/10.1109/tnet.2012.2188643openalex-snapshot
FlashTrie: Beyond 100-Gb/s IP Route Lookup Using Hash-Based Prefix-Compressed Trie
inferred← citeshttps://doi.org/10.1145/1837274.1837361openalex-snapshot
A new IP lookup cache for high performance IP routers
inferred← citeshttps://doi.org/10.1145/2463209.2488801openalex-snapshot
Low-power area-efficient large-scale IP lookup engine based on binary-weighted clustered networks
inferred← citeshttps://doi.org/10.4218/etrij.09.0108.0353openalex-snapshot
A Novel Scalable and Storage-Efficient Architecture for High Speed Exact String Matching
inferred← citeshttps://doi.org/10.5120/6366-8750openalex-snapshot
Efficient String Matching Using Deterministic Finite Automation Hardware: Speed vs Area Tradeoff
inferred← citeshttps://doi.org/10.5555/1870926.1871149openalex-snapshot
A memory- and time-efficient on-chip TCAM minimizer for IP lookup
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.