On the public citation graph
CLUE: Achieving Fast Update over Compressed Table for Parallel Lookup with Reduced Dynamic Redundancy
0 signed · 33 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/978-3-540-68807-5_9openalex-snapshot
An Efficient IP Lookup Architecture with Fast Update Using Single-Match TCAMs
inferredcites →https://doi.org/10.1109/asap.2005.32openalex-snapshot
Eliminating Sorting in IP Lookup Devices using Partitioned Table
inferredcites →https://doi.org/10.1109/conect.2002.1039265openalex-snapshot
Reducing TCAM power consumption and increasing throughput
inferredcites →https://doi.org/10.1109/conect.2004.1375199openalex-snapshot
Efficient prefix cache for network processors
inferredcites →https://doi.org/10.1109/date.2010.5456921openalex-snapshot
A memory- and time-efficient on-chip TCAM minimizer for IP lookup
inferredcites →https://doi.org/10.1109/glocom.1999.830043openalex-snapshot
IP caching for terabit speed routers
inferredcites →https://doi.org/10.1109/icc.2002.997243openalex-snapshot
Efficiency analyses on routing cache replacement algorithms
inferredcites →https://doi.org/10.1109/icc.2012.6364121openalex-snapshot
Constructing optimal non-overlap routing tables
inferredcites →https://doi.org/10.1109/infcom.1999.749256openalex-snapshot
Constructing optimal IP routing tables
inferredcites →https://doi.org/10.1109/infcom.1999.752162openalex-snapshot
High-performance IP routing table lookup using CPU caching
inferredcites →https://doi.org/10.1109/infcom.2003.1208657openalex-snapshot
Coolcams: power-efficient TCAMs for forwarding engines
inferredcites →https://doi.org/10.1109/infcom.2010.5462137openalex-snapshot
On the Aggregatability of Router Forwarding Tables
inferredcites →https://doi.org/10.1109/infcom.2011.5935172openalex-snapshot
On the scalability of router forwarding tables: Nexthop-Selectable FIB aggregation
inferredcites →https://doi.org/10.1109/inm.2011.5990546openalex-snapshot
An efficient parallel TCAM scheme for the forwarding engine of the next-generation router
inferredcites →https://doi.org/10.1109/ipdps.2007.370311openalex-snapshot
Route Table Partitioning and Load Balancing for Parallel Searching with TCAMs
inferredcites →https://doi.org/10.1109/tnet.2006.880171openalex-snapshot
A TCAM-based distributed parallel IP lookup scheme and performance analysis
inferredcites →https://doi.org/10.1145/1052812.1052827openalex-snapshot
IPv4 address allocation and the BGP routing table evolution
inferredcites →https://doi.org/10.1145/296502.296503openalex-snapshot
Fast address lookups using controlled prefix expansion
inferredcites →https://doi.org/10.5555/1870926.1871149openalex-snapshot
A memory- and time-efficient on-chip TCAM minimizer for IP lookup
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-59288-6_32openalex-snapshot
Real-Time Dynamic Decomposition Storage of Routing Tables
inferred← citeshttps://doi.org/10.1007/s42045-018-0010-1openalex-snapshot
Mathematical analysis on forwarding information base compression
inferred← citeshttps://doi.org/10.1016/j.comnet.2016.06.015openalex-snapshot
Compressing IP Forwarding Tables with Small Bounded Update Time
inferred← citeshttps://doi.org/10.1016/j.comnet.2019.106898openalex-snapshot
A power-saving pre-classifier for TCAM-based IP lookup
inferred← citeshttps://doi.org/10.1109/bigdata.2017.8257999openalex-snapshot
Rectangular hash table: Bloom filter and bitmap assisted hash table with high speed
inferred← citeshttps://doi.org/10.1109/icnisc.2017.00025openalex-snapshot
Routing Table Decomposition in Line Cards with Different Capacity
inferred← citeshttps://doi.org/10.1109/icnp.2012.6459984openalex-snapshot
An ultra-fast universal incremental update algorithm for trie-based routing lookup
inferred← citeshttps://doi.org/10.1109/icnp.2016.7784462openalex-snapshot
Fit the elephant in a box - towards IP lookup at on-chip memory access speed
inferred← citeshttps://doi.org/10.1109/iwqos.2015.7404746openalex-snapshot
Compressing IP forwarding tables with fast and bounded update
inferred← citeshttps://doi.org/10.1109/iwqos.2016.7590406openalex-snapshot
IP lookup using Minimal Perfect Hashing
inferred← citeshttps://doi.org/10.1109/noms.2014.6838342openalex-snapshot
A fresh look at Forwarding Information Base compression via mathematical analysis
inferred← citeshttps://doi.org/10.1109/pic.2014.6972399openalex-snapshot
Reducing the number of Bloom filters
inferred← citeshttps://doi.org/10.1109/tnet.2018.2815999openalex-snapshot
TCAM-Based IP Address Lookup Using Longest Suffix Split
inferred← citeshttps://doi.org/10.1109/tnet.2018.2853575openalex-snapshot
Constant IP Lookup With FIB Explosion
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.