Robust algorithms for packet routing in a mesh |
| |
Authors: | P Raghavan |
| |
Affiliation: | (1) IBM Research Division, T. J. Watson Research Center, 10598 Yorktown Heights, NY, USA |
| |
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 valuep. This paper gives a routing algorithm which, ifp 0.29, will with very high probability route every packet that can be routed inO(n logn) steps with queue lengths that areO(log2
n). Extensions to higher-dimensional meshes are given. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|