On the public citation graph

Bounds on evacuation time for deflection routing

0 signed · 66 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/0022-0000(85)90008-xopenalex-snapshot
Routing, merging, and sorting on parallel models of computation
inferredcites →https://doi.org/10.1016/0169-7552(86)90083-8openalex-snapshot
Teletraffic analysis and computer performance evaluation
inferredcites →https://doi.org/10.1038/scientificamerican0687-108openalex-snapshot
The Connection Machine
inferredcites →https://doi.org/10.1109/t-c.1975.224157openalex-snapshot
Access and Alignment of Data in an Array Processor
inferredcites →https://doi.org/10.1109/tcom.1964.1088883openalex-snapshot
On Distributed Communications Networks
inferredcites →https://doi.org/10.1117/12.932535openalex-snapshot
Architecture And Applications Of The HEP Multiprocessor Computer System
inferredcites →https://doi.org/10.1145/72935.72936openalex-snapshot
A framework for adaptive routing in multicomputer networks

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jagm.1996.0811openalex-snapshot
Randomized Single-Target Hot-Potato Routing
inferred← citeshttps://doi.org/10.1006/jagm.1998.0981openalex-snapshot
Baked-Potato Routing
inferred← citeshttps://doi.org/10.1006/jpdc.1996.0052openalex-snapshot
Minimal Adaptive Routing on the Mesh with Bounded Queue Size
inferred← citeshttps://doi.org/10.1007/3-540-44520-x_122openalex-snapshot
Experimental Evaluation of Hot—Potato Routing Algorithms on 2—Dimensional Processor Arrays
inferred← citeshttps://doi.org/10.1007/3-540-57155-8_230openalex-snapshot
Towards a better understanding of pure packet routing
inferred← citeshttps://doi.org/10.1007/3-540-58201-0_91openalex-snapshot
On the theory of interconnection networks for parallel computers
inferred← citeshttps://doi.org/10.1007/3-540-58429-3_28openalex-snapshot
The performance of adaptive routers on worst case permutations
inferred← citeshttps://doi.org/10.1007/3-540-60618-1_77openalex-snapshot
Hot-potato routing on multi-dimensional tori
inferred← citeshttps://doi.org/10.1007/3-540-61332-3_136openalex-snapshot
Wormhole versus deflection routing: A case study on the mesh
inferred← citeshttps://doi.org/10.1007/3-540-61626-8_35openalex-snapshot
Multipacket hot-potato routing on processor arrays
inferred← citeshttps://doi.org/10.1007/3-540-61680-2_76openalex-snapshot
A lower bound for nearly minimal adaptive and hot potato algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4757-2791-3_11openalex-snapshot
Bounds and Analysis Techniques for Greedy Hot-Potato Routing
inferred← citeshttps://doi.org/10.1007/978-3-540-31833-0_20openalex-snapshot
Universal Bufferless Routing
inferred← citeshttps://doi.org/10.1007/bf01784239openalex-snapshot
Greedy hot-potato routing on the two-dimensional mesh
inferred← citeshttps://doi.org/10.1007/bfb0009504openalex-snapshot
Dynamic tree routing under the “matching with consumption” model
inferred← citeshttps://doi.org/10.1007/bfb0049423openalex-snapshot
Greedy hot-potato routing on the mesh
inferred← citeshttps://doi.org/10.1007/pl00009219openalex-snapshot
A Lower Bound for Nearly Minimal Adaptive and Hot Potato Algorithms
inferred← citeshttps://doi.org/10.1007/s002240000076openalex-snapshot
Potential Function Analysis of Greedy Hot-Potato Routing
inferred← citeshttps://doi.org/10.1007/s004460050005openalex-snapshot
Networks on which hot-potato routing does not livelock
inferred← citeshttps://doi.org/10.1016/j.jpdc.2007.06.005openalex-snapshot
Efficient bufferless packet switching on trees and leveled networks
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00049-2openalex-snapshot
Many-to-many routing on trees via matchings
inferred← citeshttps://doi.org/10.1093/comjnl/45.4.423openalex-snapshot
Lower Bounds for One-to-one Packet Routing on Trees using Hot-Potato Algorithms
inferred← citeshttps://doi.org/10.1109/12.506425openalex-snapshot
A conflict sense routing protocol and its performance for hypercubes
inferred← citeshttps://doi.org/10.1109/26.142797openalex-snapshot
Deflection routing in hypercube networks
inferred← citeshttps://doi.org/10.1109/65.386051openalex-snapshot
Routing in multihop packet switching networks: Gb/s challenge
inferred← citeshttps://doi.org/10.1109/71.277792openalex-snapshot
Fully adaptive minimal deadlock-free packet routing in hypercubes, meshes, and other networks: algorithms and simulations
inferred← citeshttps://doi.org/10.1109/71.395401openalex-snapshot
Bounds on maximum delay in networks with deflection routing
inferred← citeshttps://doi.org/10.1109/71.476188openalex-snapshot
Hot-potato algorithms for permutation routing
inferred← citeshttps://doi.org/10.1109/71.595575openalex-snapshot
Deterministic many-to-many hot potato routing
inferred← citeshttps://doi.org/10.1109/71.707539openalex-snapshot
A general theory for deadlock avoidance in wormhole-routed networks
inferred← citeshttps://doi.org/10.1109/90.311628openalex-snapshot
Performance of hypercube routing schemes with or without buffering
inferred← citeshttps://doi.org/10.1109/90.469955openalex-snapshot
A performance model of deflection routing in multibuffer networks with nonuniform traffic
inferred← citeshttps://doi.org/10.1109/90.554724openalex-snapshot
On the stability of shuffle-exchange and bidirectional shuffle-exchange deflection networks
inferred← citeshttps://doi.org/10.1109/date.2009.5090823openalex-snapshot
Priority based forced requeue to reduce worst-case latencies for bursty traffic
inferred← citeshttps://doi.org/10.1109/icc.1991.162276openalex-snapshot
Effect of a finite reassembly buffer on the performance of deflection routing
inferred← citeshttps://doi.org/10.1109/infcom.1995.515924openalex-snapshot
Scheduled hot-potato routing
inferred← citeshttps://doi.org/10.1109/ispan.2000.900283openalex-snapshot
Greedy dynamic hot-potato routing on arrays
inferred← citeshttps://doi.org/10.1109/istcs.1995.377049openalex-snapshot
Observations on hot potato routing
inferred← citeshttps://doi.org/10.1109/istcs.1995.377050openalex-snapshot
Randomized single-target hot-potato routing
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267796openalex-snapshot
Exact analysis of hot-potato routing
inferred← citeshttps://doi.org/10.1109/sfcs.1994.365740openalex-snapshot
Motion planning on a graph
inferred← citeshttps://doi.org/10.1109/test.1994.527949openalex-snapshot
Transforming behavioral specifications to facilitate synthesis of testable designs
inferred← citeshttps://doi.org/10.1109/tnet.1996.502246openalex-snapshot
Correction to "A Performance Model of Deflection Routing in Multibuffer Networks with Nonuniform Tra
inferred← citeshttps://doi.org/10.1109/tpds.2007.48openalex-snapshot
The Data Vortex, an All Optical Path Multicomputer Interconnection Network
inferred← citeshttps://doi.org/10.1137/050642095openalex-snapshot
Universal Bufferless Packet Switching
inferred← citeshttps://doi.org/10.1142/s0219265904001040openalex-snapshot
THE EULERIAN STRETCH OF A NETWORK TOPOLOGY AND THE ENDING GUARANTEE OF A CONVERGENCE ROUTING
inferred← citeshttps://doi.org/10.1145/141790.141799openalex-snapshot
Bibliography of recent publications on computer communication
inferred← citeshttps://doi.org/10.1145/1637837.1637858openalex-snapshot
Formal validation of deadlock prevention in networks-on-chips
inferred← citeshttps://doi.org/10.1145/164051.164062openalex-snapshot
Fast deflection routing for packets and worms
inferred← citeshttps://doi.org/10.1145/165231.376321openalex-snapshot
Hot-potato routing on processor arrays
inferred← citeshttps://doi.org/10.1145/181014.181451openalex-snapshot
Minimal adaptive routing on the mesh with bounded queue size
inferred← citeshttps://doi.org/10.1145/197917.198098openalex-snapshot
Potential function analysis of greedy hot-potato routing
inferred← citeshttps://doi.org/10.1145/2071356.2071357openalex-snapshot
Easy Formal Specification and Validation of Unbounded Networks-on-Chips Architectures
inferred← citeshttps://doi.org/10.1145/237814.237981openalex-snapshot
Dynamic deflection routing on arrays (preliminary version)
inferred← citeshttps://doi.org/10.1145/564870.564874openalex-snapshot
Õ(congestion + dilation) hot-potato routing on leveled networks
inferred← citeshttps://doi.org/10.1364/jocn.1.000222openalex-snapshot
Mixing Convergence and Deflection Strategies for Packet Routing in All-Optical Networks
inferred← citeshttps://doi.org/10.5555/1874620.1874881openalex-snapshot
Priority based forced requeue to reduce worst-case latencies for bursty traffic
inferred← citeshttps://doi.org/10.5555/338219.338592openalex-snapshot
Randomized greedy hot-potato routing
inferred← citeshttps://doi.org/10.7155/jgaa.00007openalex-snapshot
Scheduled Hot-Potato 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.