On the public citation graph

Universal Continuous Routing Strategies

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.1006/jagm.1994.1030openalex-snapshot
Randomized Routing and Sorting on Fixed-Connection Networks
inferredcites →https://doi.org/10.1007/3-540-59042-0_81openalex-snapshot
A packet routing protocol for arbitrary networks
inferredcites →https://doi.org/10.1016/0169-7552(94)00081-4openalex-snapshot
Survey of ATM switch architectures
inferredcites →https://doi.org/10.1109/12.48863openalex-snapshot
Performance analysis of multibuffered packet-switching networks in multiprocessor systems
inferredcites →https://doi.org/10.1109/26.76464openalex-snapshot
Performance analysis of buffered Banyan networks
inferredcites →https://doi.org/10.1109/71.584091openalex-snapshot
Universal wormhole routing
inferredcites →https://doi.org/10.1109/sfcs.1988.21939openalex-snapshot
Increasing the size of a network by a constant factor can increase performance by more than a constant factor
inferredcites →https://doi.org/10.1109/sfcs.1995.492467openalex-snapshot
Contention resolution with bounded delay
inferredcites →https://doi.org/10.1109/tc.1981.1675695openalex-snapshot
Performance of Processor-Memory Interconnections for Multiprocessors
inferredcites →https://doi.org/10.1111/j.2517-6161.1985.tb01367.xopenalex-snapshot
Stochastic Models of Computer Communication Systems
inferredcites →https://doi.org/10.1145/113379.113402openalex-snapshot
The efficiency of greedy routing in hypercubes and butterflies
inferredcites →https://doi.org/10.1145/181014.181446openalex-snapshot
Bounds on the greedy routing algorithm for array networks
inferredcites →https://doi.org/10.1145/225058.225129openalex-snapshot
Stochastic contention resolution with short delays
inferredcites →https://doi.org/10.1145/225058.225133openalex-snapshot
Bounding delays in packet-routing networks
inferredcites →https://doi.org/10.1145/237502.237517openalex-snapshot
On the benefit of supporting virtual channels in wormhole routers
inferredcites →https://doi.org/10.1145/237502.237521openalex-snapshot
On the communication throughput of buffered multistage interconnection networks
inferredcites →https://doi.org/10.1145/258492.258508openalex-snapshot
The performance of simple routing algorithms that drop packets
inferredcites →https://doi.org/10.1145/28395.28422openalex-snapshot
Analysis of backoff protocols for multiple access channels
inferredcites →https://doi.org/10.1145/325096.325115openalex-snapshot
Virtual-channel flow control
inferredcites →https://doi.org/10.1145/357980.358015openalex-snapshot
Ethernet
inferredcites →https://doi.org/10.1145/44483.44488openalex-snapshot
Stability of binary exponential backoff
inferredcites →https://doi.org/10.1145/97444.97448openalex-snapshot
Average case analysis of greedy routing algorithms on arrays
inferredcites →https://doi.org/10.5555/313651.313819openalex-snapshot
Greedy dynamic routing on arrays
inferredcites →https://doi.org/10.5555/313852.314118openalex-snapshot
Analysis of practical backoff protocols for contention resolution with multiple servers

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jcss.1999.1681openalex-snapshot
Adaptive Packet Routing for Bursty Adversarial Traffic
inferred← citeshttps://doi.org/10.1007/s002240010012openalex-snapshot
Recovery Time of Dynamic Allocation Processes
inferred← citeshttps://doi.org/10.1016/j.jalgor.2004.04.013openalex-snapshot
Tight bounds for the performance of Longest In System on DAGs
inferred← citeshttps://doi.org/10.1016/j.jcss.2018.07.001openalex-snapshot
Packet latency of deterministic broadcasting in adversarial multiple access channels
inferred← citeshttps://doi.org/10.1137/s0097539799353431openalex-snapshot
From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols
inferred← citeshttps://doi.org/10.1145/276698.276788openalex-snapshot
Adaptive packet routing for bursty adversarial traffic
inferred← citeshttps://doi.org/10.1145/301250.301307openalex-snapshot
From static to dynamic routing
inferred← citeshttps://doi.org/10.1145/363647.363677openalex-snapshot
Universal-stability results and performance bounds for greedy contention-resolution protocols
inferred← citeshttps://doi.org/10.1145/3749740.3749758openalex-snapshot
Routing to Random Intermediate Destinations
inferred← citeshttps://doi.org/10.1145/375827.375849openalex-snapshot
A general approach to dynamic packet routing with bounded buffers
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.