On the public citation graph
A Classified Multisuffix Trie for IP Lookup and Update
0 signed · 37 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.1016/j.comcom.2004.10.014openalex-snapshot
Simple and fast IP lookups using binomial spanning 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.1016/j.comnet.2007.01.023openalex-snapshot
A longest prefix first search tree for IP lookup
inferredcites →https://doi.org/10.1109/90.779199openalex-snapshot
IP lookups using multiway and multicolumn search
inferredcites →https://doi.org/10.1109/hpsr.2003.1226720openalex-snapshot
IP lookup with low memory requirement and fast update
inferredcites →https://doi.org/10.1109/icn.2007.38openalex-snapshot
Dynamic Tree Bitmap for IP Lookup and Update
inferredcites →https://doi.org/10.1109/mascot.2002.1167075openalex-snapshot
Modified LC-trie based efficient routing lookup
inferredcites →https://doi.org/10.1109/tc.2004.116openalex-snapshot
Enhanced interval trees for dynamic IP router-tables
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.104openalex-snapshot
A B-tree dynamic router-table design
inferredcites →https://doi.org/10.1109/tc.2005.83openalex-snapshot
Prefix and Interval-Partitioned Dynamic IP Router-Tables
inferredcites →https://doi.org/10.1109/tc.2007.1037openalex-snapshot
Dynamic Segment Trees for Ranges and Prefixes
inferredcites →https://doi.org/10.1109/tc.2009.153openalex-snapshot
Dynamic Multiway Segment Tree for IP Lookups and the Fast Pipelined Search Engine
inferredcites →https://doi.org/10.1109/tc.2010.133openalex-snapshot
Multiprefix Trie: A New Data Structure for Designing Dynamic Router-Tables
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/296502.296503openalex-snapshot
Fast address lookups using controlled prefix expansion
inferredcites →https://doi.org/10.17487/rfc1519openalex-snapshot
Classless Inter-Domain Routing (CIDR): an Address Assignment and Aggregation Strategy
inferredcites →https://doi.org/10.17487/rfc1883openalex-snapshot
Internet Protocol, Version 6 (IPv6) Specification
inferredcites →https://doi.org/10.17487/rfc8200openalex-snapshot
Internet Protocol, Version 6 (IPv6) Specification
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s00500-020-05379-5openalex-snapshot
Searching time operation reduced IPV6 matching through dynamic DNA routing table for less memory and fast IP processing
inferred← citeshttps://doi.org/10.1016/j.comcom.2014.04.006openalex-snapshot
IP address lookup using bit-shuffled trie
inferred← citeshttps://doi.org/10.1016/j.comcom.2014.09.002openalex-snapshot
Mitigating congestion based DoS attacks with an enhanced AQM technique
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.comnet.2015.07.012openalex-snapshot
Helix: IP lookup scheme based on helicoidal properties of binary trees
inferred← citeshttps://doi.org/10.1016/j.jcss.2020.04.001openalex-snapshot
Multilevel length-based classified index table for IP lookups and updates
inferred← citeshttps://doi.org/10.1109/ants.2013.6802846openalex-snapshot
Using timers to switch-off TCAM banks in routers
inferred← citeshttps://doi.org/10.1109/glocom.2013.6831276openalex-snapshot
Mitigating congestion-based denial of service attacks with active queue management
inferred← citeshttps://doi.org/10.1109/hpcc/smartcity/dss.2018.00092openalex-snapshot
PATIP-TREE: An Efficient Method to Look up the Network Address Attribution Information
inferred← citeshttps://doi.org/10.1109/iccke.2015.7365829openalex-snapshot
A longest prefix matching method using Rectangular-Tree
inferred← citeshttps://doi.org/10.1109/tc.2016.2574347openalex-snapshot
Multi-Inherited Search Tree for Dynamic IP Router-Tables
inferred← citeshttps://doi.org/10.1109/tpds.2013.214openalex-snapshot
A Multi-Index Hybrid Trie for Lookup and Updates
inferred← citeshttps://doi.org/10.1186/s13174-017-0075-yopenalex-snapshot
High-performance IP lookup using Intel Xeon Phi: a Bloom filters based approach
inferred← citeshttps://doi.org/10.2298/bg20120712cicaopenalex-snapshot
Implementation of packet processing functions in high capacity internet routers
inferred← citeshttps://doi.org/10.5755/j02.eie.28903openalex-snapshot
Scalable Balanced Pipelined IPv6 Lookup Algorithm
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.