Answers are grounded in this paper and cite their sources.
A probabilistic routing policy, the Z/sup 2/ (zigzag) routing policy, is presented within the class of nonadaptive, shortest-path routing policies for regular mesh-connected topologies such as n-dimensional toroids and hypercubes. The focus of the research is routing in networks of computers in a distributed computing environment, where constituent subcomputers are organized in a mesh-connected topology and communication among individual computers takes places by some form of message exchange. The authors prove the optimality of this policy with respect to two criteria: (1) maximizing the probability of reaching the destination from a given source without delays at intermediate nodes; and (2) minimizing the expected lifetime of a message.>
No takes yet. Share an insight, caveat, or question.
Badr et al. (1989) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: