On the public citation graph

Distributed Multi-Destination Routing: The Constraints of Local Information

https://doi.org/10.1137/0214062
0 signed · 28 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.1109/tcom.1978.1094040openalex-snapshot
A Review of the Development and Performance of the ARPANET Routing Algorithm
inferredcites →https://doi.org/10.1109/tcom.1980.1094690openalex-snapshot
Routing Techniques Used in Computer Communication Networks
inferredcites →https://doi.org/10.1109/tcom.1981.1095152openalex-snapshot
Flow Control Power is Nondecentralizable
inferredcites →https://doi.org/10.1109/tcom.1983.1095818openalex-snapshot
Routing to Multiple Destinations in Computer Networks
inferredcites →https://doi.org/10.1137/0116001openalex-snapshot
Steiner Minimal Trees
inferredcites →https://doi.org/10.1145/322276.322284openalex-snapshot
Algorithms for Scheduling Tasks on Unrelated Processors
inferredcites →https://doi.org/10.1145/359657.359665openalex-snapshot
Reverse path forwarding of broadcast packets

What points at this work

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

inferred← citeshttps://doi.org/10.1007/s00454-009-9230-yopenalex-snapshot
Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners
inferred← citeshttps://doi.org/10.1016/0169-7552(86)90053-xopenalex-snapshot
Subtle design issues in the implementation of distributed, dynamic routing algorithms
inferred← citeshttps://doi.org/10.1016/0169-7552(90)90014-jopenalex-snapshot
Graph theoretic models for multicast communications
inferred← citeshttps://doi.org/10.1016/s0305-0548(00)00029-0openalex-snapshot
A note on distributed multicast routing in point-to-point networks
inferred← citeshttps://doi.org/10.1016/s0305-0548(96)00074-3openalex-snapshot
Distributed multicast routing in point-to-point networks
inferred← citeshttps://doi.org/10.1109/49.12889openalex-snapshot
Routing of multipoint connections
inferred← citeshttps://doi.org/10.1109/49.564135openalex-snapshot
Destination-driven routing for low-cost multicast
inferred← citeshttps://doi.org/10.1109/71.485503openalex-snapshot
A trip-based multicasting model in wormhole-routed networks with virtual channels
inferred← citeshttps://doi.org/10.1109/eurmic.1994.390419openalex-snapshot
Distributed multicast routing mechanism for global point-to-point networks
inferred← citeshttps://doi.org/10.1109/focs.2008.24openalex-snapshot
Shallow-Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners
inferred← citeshttps://doi.org/10.1109/focs.2011.18openalex-snapshot
Steiner Shallow-Light Trees are Exponentially Lighter than Spanning Ones
inferred← citeshttps://doi.org/10.1109/ipps.1993.262893openalex-snapshot
A trip-based multicasting model for wormhole-routed networks with virtual channels
inferred← citeshttps://doi.org/10.1109/tcom.1983.1095818openalex-snapshot
Routing to Multiple Destinations in Computer Networks
inferred← citeshttps://doi.org/10.1109/wpdrts.1997.637869openalex-snapshot
Multiple node-disjoint path protocol for virtual paths in ATM networks
inferred← citeshttps://doi.org/10.1137/0404033openalex-snapshot
Dynamic Steiner Tree Problem
inferred← citeshttps://doi.org/10.1137/13094791xopenalex-snapshot
Steiner Shallow-Light Trees Are Exponentially Lighter than Spanning Ones
inferred← citeshttps://doi.org/10.1145/193285.193296openalex-snapshot
Minimising packet copies in multicast routing by exploiting geographic spread
inferred← citeshttps://doi.org/10.1145/3055399.3055452openalex-snapshot
Distributed exact shortest paths in sublinear time
inferred← citeshttps://doi.org/10.1145/3387161openalex-snapshot
Distributed Exact Shortest Paths in Sublinear Time
inferred← citeshttps://doi.org/10.48550/arxiv.0801.3581openalex-snapshot
Shallow, Low, and Light Trees, and Tight Lower Bounds for Euclidean Spanners
inferred← citeshttps://doi.org/10.7166/8-2-394openalex-snapshot
OPTIMAL DISTRIBUTION OF REPLICATED DATA IN COMPUTER NETWORKS
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.