On the public citation graph

ARPANET Routing Algorithm Improvements

0 signed · 32 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 points at this work

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

inferred← citeshttps://doi.org/10.1007/978-1-4471-5173-9_7openalex-snapshot
Routing
inferred← citeshttps://doi.org/10.1007/bf02139533openalex-snapshot
A route pre-computation algorithm for integrated services networks
inferred← citeshttps://doi.org/10.1016/s0065-2458(08)60340-xopenalex-snapshot
Control of Information Distribution and Access
inferred← citeshttps://doi.org/10.1016/s1389-1286(02)00271-2openalex-snapshot
Engineering a multiservice IP backbone to support tight SLAs
inferred← citeshttps://doi.org/10.1023/a:1019153519539openalex-snapshot
Proxy PNNI Augmented Routing (Proxy PAR)
inferred← citeshttps://doi.org/10.1109/26.48894openalex-snapshot
A new metric for dynamic routing algorithms
inferred← citeshttps://doi.org/10.1109/aict.2008.21openalex-snapshot
Fast Recovery Paths: Reducing Packet Loss Rates during IP Routing Convergence
inferred← citeshttps://doi.org/10.1109/aina.2008.11openalex-snapshot
A Fast Rerouting Approach to Reduce Packet Loss during IP Routing Protocols Convergence
inferred← citeshttps://doi.org/10.1109/digcom.1992.211653openalex-snapshot
Crises in network evolution: three case studies and one proposed solution
inferred← citeshttps://doi.org/10.1109/glocom.2000.892048openalex-snapshot
Fast link state flooding
inferred← citeshttps://doi.org/10.1109/icatm.1998.688201openalex-snapshot
Proxy PNNI augmented routing (proxy PAR)
inferred← citeshttps://doi.org/10.1109/icsmc.1991.169782openalex-snapshot
Realism vs. optimality: a systems-engineered wide area network design system
inferred← citeshttps://doi.org/10.1109/infcom.1999.749255openalex-snapshot
Hop-by-hop routing with node-dependent topology information
inferred← citeshttps://doi.org/10.1109/mahc.2009.17openalex-snapshot
The Birth of Link-State Routing
inferred← citeshttps://doi.org/10.1109/mc.1984.1659240openalex-snapshot
Letters to the Editor
inferred← citeshttps://doi.org/10.1109/milcom.1986.4805715openalex-snapshot
Reducing Routing Overhead in a Growing DDN
inferred← citeshttps://doi.org/10.1109/milcom.1989.103929openalex-snapshot
Performance of the revised routing metric in the ARPANET and MILNET
inferred← citeshttps://doi.org/10.1109/milcom.2011.6127608openalex-snapshot
Disconnection-resilient IP link-state routing for airborne networks
inferred← citeshttps://doi.org/10.1109/noms.2008.4575192openalex-snapshot
Fast recovery paths schema to improve reliability in IP networks
inferred← citeshttps://doi.org/10.1109/proc.1978.11153openalex-snapshot
Enhanced message addressing capabilities for computer networks
inferred← citeshttps://doi.org/10.1109/tac.1982.1102884openalex-snapshot
Dynamic behavior of shortest path routing algorithms for communication networks
inferred← citeshttps://doi.org/10.1109/tc.1983.1676215openalex-snapshot
File Allocation in a Distributed Computer Communication Network
inferred← citeshttps://doi.org/10.1109/tc.1983.1676216openalex-snapshot
A Quantization Approximation for Modeling Computer Network Nodal Queueing Delay
inferred← citeshttps://doi.org/10.1109/tcom.1978.1094040openalex-snapshot
A Review of the Development and Performance of the ARPANET Routing Algorithm
inferred← citeshttps://doi.org/10.1109/tcom.1980.1094721openalex-snapshot
The New Routing Algorithm for the ARPANET
inferred← citeshttps://doi.org/10.1109/tsmcb.2012.2221695openalex-snapshot
Efficient Shortest-Path-Tree Computation in Network Routing Based on Pulse-Coupled Neural Networks
inferred← citeshttps://doi.org/10.1145/1015621.1015625openalex-snapshot
Bifurcated routing in computer networks
inferred← citeshttps://doi.org/10.1145/52324.52329openalex-snapshot
The landmark hierarchy: a new hierarchy for routing in very large networks
inferred← citeshttps://doi.org/10.1145/52325.52329openalex-snapshot
The landmark hierarchy: a new hierarchy for routing in very large networks
inferred← citeshttps://doi.org/10.32628/ijsrst2310015openalex-snapshot
Study of Ad- Hoc Networking Technologies and Optimization of The Broadcasting Process
inferred← citeshttps://doi.org/10.32628/ijsrst52310226openalex-snapshot
Empirical Study on Wireless Multimedia & Mesh Ad-Hoc Network
inferred← citeshttps://doi.org/10.5121/ijcnc.2012.4202openalex-snapshot
Fast Emergency Paths Schema to Overcome Transient Link Failures in OSPF Routing
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.