On the public citation graph

Managing routing tables for URL routers in content distribution networks

0 signed · 34 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.1016/0020-0190(85)90103-6openalex-snapshot
Self-adjusting hash tables
inferredcites →https://doi.org/10.1016/s0140-3664(00)00316-9openalex-snapshot
Performance evaluation of redirection schemes in content distribution networks
inferredcites →https://doi.org/10.1016/s0140-3664(98)00138-8openalex-snapshot
Efficient computation of packet CRC from partial CRCs with application to the Cells-In-Frames protocol
inferredcites →https://doi.org/10.1109/infcom.2000.832241openalex-snapshot
URL forwarding and compression in adaptive Web caching
inferredcites →https://doi.org/10.1109/ipccc.2002.995135openalex-snapshot
Using signatures to improve URL routing
inferredcites →https://doi.org/10.1109/ipps.1996.508191openalex-snapshot
SWEB: towards a scalable World Wide Web server on multicomputers
inferredcites →https://doi.org/10.1109/lcn.2002.1181803openalex-snapshot
Efficient summarization of URLs using CRC32 for implementing URL switching
inferredcites →https://doi.org/10.1145/233008.233034openalex-snapshot
Web server workload characterization
inferredcites →https://doi.org/10.1145/268998.266662openalex-snapshot
Cluster-based scalable network services
inferredcites →https://doi.org/10.1145/285237.285287openalex-snapshot
Summary cache
inferredcites →https://doi.org/10.1145/285243.285287openalex-snapshot
Summary cache
inferredcites →https://doi.org/10.1145/3341.3349openalex-snapshot
Amortized analyses of self-organizing sequential search heuristics
inferredcites →https://doi.org/10.1145/359997.360000openalex-snapshot
On self-organizing sequential search heuristics
inferredcites →https://doi.org/10.1145/362686.362692openalex-snapshot
Space/time trade-offs in hash coding with allowable errors
inferredcites →https://doi.org/10.1145/63030.63037openalex-snapshot
Computation of cyclic redundancy checks via table look-up
inferredcites →https://doi.org/10.17487/rfc1321openalex-snapshot
The MD5 Message-Digest Algorithm
inferredcites →https://doi.org/10.17487/rfc1631openalex-snapshot
The IP Network Address Translator (NAT)
inferredcites →https://doi.org/10.17487/rfc2186openalex-snapshot
Internet Cache Protocol (ICP), version 2
inferredcites →https://doi.org/10.17487/rfc2672openalex-snapshot
Non-Terminal DNS Name Redirection
inferredcites →https://doi.org/10.2307/2005383openalex-snapshot
The Art of Computer Programming, Vol. 3: Sorting and Searching
inferredcites →https://doi.org/10.5555/339671.339709openalex-snapshot
TCP splice application layer proxy performance

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/1-4020-5261-8_28openalex-snapshot
Queueing Behavior of Hashing Methods Used to Build URL Routing Tables
inferred← citeshttps://doi.org/10.1016/j.comnet.2013.07.006openalex-snapshot
GPU-accelerated name lookup with component encoding
inferred← citeshttps://doi.org/10.1016/j.procs.2017.12.098openalex-snapshot
New Results on Competitive Analysis of Move To Middle(MTM) List Update Algorithm using Doubly Linked List
inferred← citeshttps://doi.org/10.1109/aina.2005.229openalex-snapshot
Java Application’s Packet Eavesdropper for Content Delivery Network
inferred← citeshttps://doi.org/10.1109/glocom.2011.6134161openalex-snapshot
Parallel Name Lookup for Named Data Networking
inferred← citeshttps://doi.org/10.1109/icc.2010.5501982openalex-snapshot
A High-Performance URL Lookup Engine for URL Filtering Systems
inferred← citeshttps://doi.org/10.1109/icdcs.2012.35openalex-snapshot
Scalable Name Lookup in NDN Using Effective Name Component Encoding
inferred← citeshttps://doi.org/10.1109/icnp.2018.00046openalex-snapshot
A Fast and Memory-Efficient Trie Structure for Name-Based Packet Forwarding
inferred← citeshttps://doi.org/10.1109/infcom.2013.6566742openalex-snapshot
NameFilter: Achieving fast name lookup with low memory cost via applying two-stage Bloom filters
inferred← citeshttps://doi.org/10.1109/infocom.2008.242openalex-snapshot
A Memory-Efficient Hashing by Multi-Predicate Bloom Filters for Packet Classification
inferred← citeshttps://doi.org/10.1109/isdea.2012.169openalex-snapshot
ERDSR: Efficient and Reliable Dynamic Service Routing in Enterprise Service Bus
inferred← citeshttps://doi.org/10.1109/reconfig.2012.6416719openalex-snapshot
A FPGA-based scalable architecture for URL legal filtering in 100GbE networks
inferred← citeshttps://doi.org/10.1109/tnet.2019.2901487openalex-snapshot
On the Granularity of Trie-Based Data Structures for Name Lookups and Updates
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.