On the public citation graph
NXG06-1: An Efficient IP Address Lookup Algorithm Using a Priority Trie
0 signed · 31 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/65.912716openalex-snapshot
Survey and taxonomy of IP address lookup algorithms
inferredcites →https://doi.org/10.1109/90.779199openalex-snapshot
IP lookups using multiway and multicolumn search
inferredcites →https://doi.org/10.1109/hpsr.2000.856650openalex-snapshot
Fast and scalable schemes for the IP address lookup problem
inferredcites →https://doi.org/10.1109/hpsr.2004.1303436openalex-snapshot
A parallel multiple hashing architecture for IP address lookup
inferredcites →https://doi.org/10.1109/hpsr.2005.1503281openalex-snapshot
Binary search in a balanced tree for IP address lookup
inferredcites →https://doi.org/10.1109/infcom.2001.916641openalex-snapshot
Using multiple hash functions to improve IP lookups
inferredcites →https://doi.org/10.1109/lcomm.2003.818885openalex-snapshot
High speed IP address lookup architecture using hashing
inferredcites →https://doi.org/10.1109/lcomm.2005.1375247openalex-snapshot
Binary searches on multiple small trees for IP address lookup
inferredcites →https://doi.org/10.1109/lcomm.2005.1461694openalex-snapshot
Efficient binary search for IP address lookup
inferredcites →https://doi.org/10.1109/tnet.2003.815288openalex-snapshot
Efficient construction of multibit tries 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/263105.263136openalex-snapshot
Scalable high speed IP routing lookups
inferredcites →https://doi.org/10.1145/263109.263133openalex-snapshot
Small forwarding tables for fast routing lookups
inferredcites →https://doi.org/10.1145/263109.263136openalex-snapshot
Scalable high speed IP routing lookups
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-981-10-0135-2_18openalex-snapshot
Prefix Length-Based Disjoint Set Tries for IPv6 Lookup
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.2015.12.009openalex-snapshot
Radient: Scalable, memory efficient name lookup algorithm for named data networking
inferred← citeshttps://doi.org/10.1016/j.jnca.2016.09.007openalex-snapshot
N-FIB: Scalable, memory efficient name-based forwarding
inferred← citeshttps://doi.org/10.1109/hpsr.2011.5986037openalex-snapshot
FPGA implementation of lookup algorithms
inferred← citeshttps://doi.org/10.1109/hpsr.2013.6602309openalex-snapshot
IP address lookup using GPU
inferred← citeshttps://doi.org/10.1109/iccke.2015.7365829openalex-snapshot
A longest prefix matching method using Rectangular-Tree
inferred← citeshttps://doi.org/10.1109/icnisc.2015.17openalex-snapshot
The Development Status and Trend of NetFPGA
inferred← citeshttps://doi.org/10.1109/surv.2011.061411.00095openalex-snapshot
Survey and Proposal on Binary Search Algorithms for Longest Prefix Match
inferred← citeshttps://doi.org/10.1109/tc.2010.38openalex-snapshot
Priority Tries for IP Address Lookup
inferred← citeshttps://doi.org/10.1109/tcomm.2009.03.070146openalex-snapshot
IP address lookup for internet routers using balanced binary search with prefix vector
inferred← citeshttps://doi.org/10.1109/tetc.2015.2460453openalex-snapshot
IP Address Lookup by Using GPU
inferred← citeshttps://doi.org/10.1109/tnet.2018.2815999openalex-snapshot
TCAM-Based IP Address Lookup Using Longest Suffix Split
inferred← citeshttps://doi.org/10.12785/amis/070102openalex-snapshot
Priority Area-based Quad-Tree Packet Classification Algorithm and Its Mathematical Framework
inferred← citeshttps://doi.org/10.1587/transcom.e93.b.1009openalex-snapshot
A Fast IP Address Lookup Algorithm Based on Search Space Reduction
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.