Robust algorithms for packet routing in a mesh
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Robust bounded-degree networks with small diameters
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Multi-scale self-simulation: a technique for reconfiguring arrays with faults
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On the fault tolerance of the butterfly
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Wait-Free Deflection Routing of Long Messages
IEEE Transactions on Parallel and Distributed Systems
On tolerating single link, double link, and nodal failures in symmetric grid networks
Journal of High Speed Networks
The effect of faults on network expansion
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Routing complexity of faulty networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Routing complexity of faulty networks
Random Structures & Algorithms
On the price of security in large-scale wireless ad hoc networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
Let H be an n x n mesh-connected array of processors. Each processor is assumed to fail (independently) with probability p. Raghavan [5] gave an algorithm that with high probability routes packets in this mesh with O(log n) dilation and O(log2n) load so long as p ≤ 0.29. KKLMRRTT [3] improve the load to O(1) for “small” p while keeping the O(log n) bound for dilation and showing an o(1) bound for congestion. In this paper we show these bounds hold for p as high as *** 0.4. We also consider the problem where links rather than processors fail and shows these same bounds hold for q