About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
Mathematical Systems Theory
Paper
Robust algorithms for packet routing in a mesh
Abstract
This paper considers the problem of permutation packet routing on a √n×√n mesh-connected array of processors. Each node in the array is assumed to be independently faulty with a probability bounded above by a value p. This paper gives a routing algorithm which, if p≤ 0.29, will with very high probability route every packet that can be routed in O(√n log n) steps with queue lengths that are O(log2n). Extensions to higher-dimensional meshes are given. © 1995 Springer-Verlag New York Inc.