On the public citation graph
Memory-Efficient IPv4/v6 Lookup on FPGAs Using Distance-Bounded Path Compression
0 signed · 35 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.1002/0470113952openalex-snapshot
High Performance Switches and Routers
inferredcites →https://doi.org/10.1002/spe.4380250203openalex-snapshot
Efficient implementation of suffix trees
inferredcites →https://doi.org/10.1016/j.comnet.2003.09.004openalex-snapshot
Multiway range trees: scalable IP lookup with fast updates
inferredcites →https://doi.org/10.1109/65.912716openalex-snapshot
Survey and taxonomy of IP address lookup algorithms
inferredcites →https://doi.org/10.1109/conect.2004.1375198openalex-snapshot
Non-random generator for IPv6 tables
inferredcites →https://doi.org/10.1109/fccm.2006.67openalex-snapshot
Systematic Characterization of Programmable Packet Processing Pipelines
inferredcites →https://doi.org/10.1109/fccm.2008.55openalex-snapshot
Autonomous System on a Chip Adaptation through Partial Runtime Reconfiguration
inferredcites →https://doi.org/10.1109/fccm.2008.9openalex-snapshot
A SRAM-based Architecture for Trie-based IP Lookup Using FPGA
inferredcites →https://doi.org/10.1109/fccm.2009.42openalex-snapshot
Scalable High Throughput and Power Efficient IP-Lookup on FPGA
inferredcites →https://doi.org/10.1109/icnp.2009.5339697openalex-snapshot
Scalable IP lookups using shape graphs
inferredcites →https://doi.org/10.1109/infcom.2009.5062179openalex-snapshot
Scalar Prefix Search: A New Route Lookup Algorithm for Next Generation Internet
inferredcites →https://doi.org/10.1109/infcom.2009.5062180openalex-snapshot
IPv6 Lookups using Distributed and Load Balanced Bloom Filters for 100Gbps Core Router Line Cards
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
inferredcites →https://doi.org/10.1109/isca.2005.7openalex-snapshot
A Tree Based Router Search Engine Architecture with Single Port Memories
inferredcites →https://doi.org/10.1109/jsac.2006.877131openalex-snapshot
Fast and Scalable Pattern Matching for Network Intrusion Detection Systems
inferredcites →https://doi.org/10.1109/mc.2008.125openalex-snapshot
Hardware Technologies for High-Performance Data-Intensive Computing
inferredcites →https://doi.org/10.1109/pccc.2010.5682304openalex-snapshot
FRuG: A benchmark for packet forwarding in future networks
inferredcites →https://doi.org/10.1109/tc.2005.104openalex-snapshot
A B-tree dynamic router-table design
inferredcites →https://doi.org/10.1109/tnet.2005.850216openalex-snapshot
Fast incremental updates for pipelined forwarding engines
inferredcites →https://doi.org/10.1109/tnet.2005.852878openalex-snapshot
Scalable, memory efficient, high-speed IP lookup algorithms
inferredcites →https://doi.org/10.1145/1080695.1069979openalex-snapshot
A Tree Based Router Search Engine Architecture with Single Port Memories
inferredcites →https://doi.org/10.1145/1095890.1095903openalex-snapshot
A novel reconfigurable hardware architecture for IP address lookup
inferredcites →https://doi.org/10.1145/1882486.1882520openalex-snapshot
Range Tries for scalable address lookup
inferredcites →https://doi.org/10.1145/321479.321481openalex-snapshot
PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric
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-642-53959-6_13openalex-snapshot
An Efficient Update Mechanism for GPU-Based IP Lookup Engine Using Threaded Segment Tree
inferred← citeshttps://doi.org/10.1016/j.comcom.2013.10.005openalex-snapshot
A memory-efficient parallel routing lookup model with fast updates
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2013.10.011openalex-snapshot
Large-scale SRAM-based IP lookup architectures using compact trie search structures
inferred← citeshttps://doi.org/10.1109/csndsp.2018.8471817openalex-snapshot
Highspeed hierarchical routing – a practical approach to single-clock routing
inferred← citeshttps://doi.org/10.1109/hoti.2013.11openalex-snapshot
Clustered Linked List Forest for IPv6 Lookup
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/tc.2013.109openalex-snapshot
LayeredTrees: Most Specific Prefix-Based Pipelined Design for On-Chip IP Address Lookups
inferred← citeshttps://doi.org/10.1145/2400682.2400684openalex-snapshot
A performance and energy comparison of convolution on GPUs, FPGAs, and multicore processors
inferred← citeshttps://doi.org/10.4304/jcp.8.10.2724-2729openalex-snapshot
A Time Efficient Algorithm Based on Bloom Filters for Longest Prefix Matching in IP Lookups
inferred← citeshttps://doi.org/10.9708/jksci.2016.21.5.049openalex-snapshot
High Performance IP Address Lookup Using GPU
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.