On the public citation graph

Route Table Partitioning and Load Balancing for Parallel Searching with TCAMs

0 signed · 42 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-540-24668-8_10openalex-snapshot
The Effect of Flow Capacities on the Burstiness of Aggregated Traffic
inferredcites →https://doi.org/10.1049/ip-com:20050652openalex-snapshot
Address lookup algorithms for IPv6
inferredcites →https://doi.org/10.1109/40.988690openalex-snapshot
Routing table compaction in ternary CAM
inferredcites →https://doi.org/10.1109/49.772439openalex-snapshot
IP-address lookup using LC-tries
inferredcites →https://doi.org/10.1109/65.912716openalex-snapshot
Survey and taxonomy of IP address lookup algorithms
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/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/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.2004.1354607openalex-snapshot
An ultra high throughput and power efficient TCAM-based IP lookup engine
inferredcites →https://doi.org/10.1109/infocom.2006.241openalex-snapshot
IPv6-Oriented 4xOC-768 Packet Classification with Deriving-Merging Partition and Field-Variable Encoding Algorithm

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/978-3-642-02457-3_72openalex-snapshot
A Hybrid IP Forwarding Engine with High Performance and Low Power
inferred← citeshttps://doi.org/10.1007/978-94-007-2169-2_5openalex-snapshot
Multi-Stage TCAMs Architecture for IP Lookup
inferred← citeshttps://doi.org/10.1007/s12083-014-0303-1openalex-snapshot
On storage partitioning of internet routing tables: A P2P-based enhancement for scalable routers
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.2012.04.027openalex-snapshot
A comparative review of scalable lookup algorithms for IPv6
inferred← citeshttps://doi.org/10.1016/j.jpdc.2009.04.001openalex-snapshot
Sequence-preserving parallel IP lookup using multiple SRAM-based pipelines
inferred← citeshttps://doi.org/10.1109/glocom.2011.6134161openalex-snapshot
Parallel Name Lookup for Named Data Networking
inferred← citeshttps://doi.org/10.1109/greencom-cpscom.2010.119openalex-snapshot
Power-Aware TCAMs for Routing Table Lookup
inferred← citeshttps://doi.org/10.1109/hoti.2013.11openalex-snapshot
Clustered Linked List Forest for IPv6 Lookup
inferred← citeshttps://doi.org/10.1109/hpsr.2009.5307440openalex-snapshot
Compress the route table stored in TCAM by using memory filter
inferred← citeshttps://doi.org/10.1109/icc.2012.6364121openalex-snapshot
Constructing optimal non-overlap routing tables
inferred← citeshttps://doi.org/10.1109/icdcs.2012.79openalex-snapshot
CLUE: Achieving Fast Update over Compressed Table for Parallel Lookup with Reduced Dynamic Redundancy
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/infcom.2010.5462160openalex-snapshot
CompactDFA: Generic State Machine Compression for Scalable Pattern Matching
inferred← citeshttps://doi.org/10.1109/infocom41043.2020.9155470openalex-snapshot
T-cache: Dependency-free Ternary Rule Cache for Policy-based Forwarding
inferred← citeshttps://doi.org/10.1109/inm.2011.5990546openalex-snapshot
An efficient parallel TCAM scheme for the forwarding engine of the next-generation router
inferred← citeshttps://doi.org/10.1109/ipdps.2008.4536259openalex-snapshot
Parallel IP lookup using multiple SRAM-based pipelines
inferred← citeshttps://doi.org/10.1109/iscis.2009.5291832openalex-snapshot
MIPS extension for a TCAM based parallel architecture for fast IP lookup
inferred← citeshttps://doi.org/10.1109/iwqos.2010.5542724openalex-snapshot
Efficient parallel searching with TCAMs
inferred← citeshttps://doi.org/10.1109/lcn.2010.5735708openalex-snapshot
Efficient searching with parallel TCAM chips
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/reconfig.2012.6416734openalex-snapshot
Compact trie forest: Scalable architecture for IP lookup on FPGAs
inferred← citeshttps://doi.org/10.1109/reconfig.2012.6416760openalex-snapshot
A memory efficient IPv6 lookup engine on FPGA
inferred← citeshttps://doi.org/10.1109/tnet.2021.3098320openalex-snapshot
T-Cache: Efficient Policy-Based Forwarding Using Small TCAM
inferred← citeshttps://doi.org/10.1109/ton.2026.3724954openalex-snapshot
N-Trie: A High-Throughput IPv6 Lookup Architecture Based on Nested Trie
inferred← citeshttps://doi.org/10.1145/2145694.2145762openalex-snapshot
Scalable architecture for 135 GBPS IPv6 lookup on FPGA (abstract only)
inferred← citeshttps://doi.org/10.2298/bg20120712cicaopenalex-snapshot
Implementation of packet processing functions in high capacity internet routers
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.