Jesse M. Gordon

TL;DR: This paper considers the basic problem of routing a single message from an arbitrary source to an arbitrary destination, and shows that the a priori probability of successful message routing is high even for an exceedingly large number of faults.

TL;DR: This thesis examines the problems of designing massively fault-tolerant routing schemes and analyzing their performance by showing that a simple technique, requiring only simple assumptions, produces routing schemes which achieve high performance in a wide range of applications.

TL;DR: For single-message routing on a hypercube, it is shown that the performance of a sidetracking scheme is near optimal, successfully routing with high probability and low average excess delay.

TL;DR: This paper presents a framework for the analysis of routing schemes in distributed memory multiprocessor systems containing faulty or unusable components, and introduces techniques for the derivation of the probabilities of successfully routing a single inessage using minimal path routing schemes.