On the public citation graph

Routing table partitioning for speedy packet lookups in scalable routers

0 signed · 52 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/40.566196openalex-snapshot
Spider: a high-speed network interconnect
inferredcites →https://doi.org/10.1109/40.820050openalex-snapshot
Cache memory design for Internet processors
inferredcites →https://doi.org/10.1109/49.772427openalex-snapshot
A framework for optimizing the cost and performance of next-generation IP routers
inferredcites →https://doi.org/10.1109/49.772439openalex-snapshot
IP-address lookup using LC-tries
inferredcites →https://doi.org/10.1109/65.642356openalex-snapshot
Wide-area Internet traffic patterns and characteristics
inferredcites →https://doi.org/10.1109/65.912716openalex-snapshot
Survey and taxonomy of IP address lookup algorithms
inferredcites →https://doi.org/10.1109/90.503764openalex-snapshot
Routing on longest-matching prefixes
inferredcites →https://doi.org/10.1109/glocom.1999.832484openalex-snapshot
Inter-AS traffic patterns and their implications
inferredcites →https://doi.org/10.1109/hpca.1999.744357openalex-snapshot
Switch cache: a framework for improving the remote memory access latency of CC-NUMA multiprocessors
inferredcites →https://doi.org/10.1109/icc.2002.997249openalex-snapshot
An IP packet forwarding technique based on partitioned lookup table
inferredcites →https://doi.org/10.1109/icpp.2003.1240561openalex-snapshot
Hardware-assisted design for fast packet forwarding in parallel routers
inferredcites →https://doi.org/10.1109/infcom.1998.662938openalex-snapshot
Routing lookups in hardware at memory access speeds
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.2002.1019300openalex-snapshot
Efficient hardware architecture for fast IP address lookup
inferredcites →https://doi.org/10.1109/infcom.2003.1208659openalex-snapshot
Fast incremental updates for pipelined 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/isca.1990.134547openalex-snapshot
Improving direct-mapped cache performance by the addition of a small fully-associative cache and prefetch buffers
inferredcites →https://doi.org/10.1109/mm.2004.1289292openalex-snapshot
TCAM architecture for IP lookup using prefix properties
inferredcites →https://doi.org/10.1109/sc.2002.10006openalex-snapshot
Improving Route Lookup Performance Using Network Processor Cache
inferredcites →https://doi.org/10.1109/tc.2004.1261840openalex-snapshot
An O(log n) dynamic router-table design
inferredcites →https://doi.org/10.1109/tc.2005.78openalex-snapshot
EaseCAM: An Energy and Storage Efficient TCAM-Based Router Architecture for IP Lookup
inferredcites →https://doi.org/10.1145/263105.263133openalex-snapshot
Small forwarding tables for fast routing lookups
inferredcites →https://doi.org/10.1145/263109.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/285930.285998openalex-snapshot
Improving direct-mapped cache performance by the addition of a small fully-associative cache prefetch buffers
inferredcites →https://doi.org/10.1145/296502.296503openalex-snapshot
Fast address lookups using controlled prefix expansion
inferredcites →https://doi.org/10.1145/502912.502914openalex-snapshot
Scalable high-speed prefix matching
inferredcites →https://doi.org/10.1145/505202.505212openalex-snapshot
New directions in traffic measurement and accounting
inferredcites →https://doi.org/10.1145/633025.633056openalex-snapshot
New directions in traffic measurement and accounting
inferredcites →https://doi.org/10.1145/964725.633056openalex-snapshot
New directions in traffic measurement and accounting
inferredcites →https://doi.org/10.5555/762761.762807openalex-snapshot
Improving Route Lookup Performance Using Network Processor Cache

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-35668-1_32openalex-snapshot
Compact TCAM: Flow Entry Compaction in TCAM for Power Aware SDN
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.1016/j.jpdc.2013.03.005openalex-snapshot
Hint-based cache design for reducing miss penalty in HBS packet classification algorithm
inferred← citeshttps://doi.org/10.1016/j.sysarc.2008.08.001openalex-snapshot
IP Routing table compaction and sampling schemes to enhance TCAM cache performance
inferred← citeshttps://doi.org/10.1109/cnsm.2014.7014147openalex-snapshot
Tag-In-Tag: Efficient flow table management in SDN switches
inferred← citeshttps://doi.org/10.1109/comsnets.2009.4808884openalex-snapshot
Trie partitioning in distributed PC based routers
inferred← citeshttps://doi.org/10.1109/glocom.2010.5683639openalex-snapshot
A Hybrid Approach to CAM-Based Longest Prefix Matching for IP Route Lookup
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/iscc.2007.4381472openalex-snapshot
Recursively Partitioned Static IP Router-Tables
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.2010.5735761openalex-snapshot
A distributed parallel approach for BGP routing table partitioning in next generation routers
inferred← citeshttps://doi.org/10.1109/nca.2007.20openalex-snapshot
Exact Forwarding Table Partitioning for Efficient TCAM Power Savings
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.2018.2815999openalex-snapshot
TCAM-Based IP Address Lookup Using Longest Suffix Split
inferred← citeshttps://doi.org/10.1142/s0218126616300026openalex-snapshot
A Comprehensive Review of Energy Efficient Content Addressable Memory Circuits for Network Applications
inferred← citeshttps://doi.org/10.1201/9780849380587-10openalex-snapshot
Routing-Table Partitioning Technologies
inferred← citeshttps://doi.org/10.1201/9780849380587.ch10openalex-snapshot
Routing-Table Partitioning Technologies
inferred← citeshttps://doi.org/10.3724/sp.j.1016.2011.01611openalex-snapshot
Decomposed Storage Model of FIB for Cluster Router
inferred← citeshttps://doi.org/10.71781/10237openalex-snapshot
Une architecture parallèle distribuée et tolérante aux pannes pour le protocole interdomaine BGP au cœur de l’Internet
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.