Efficient dispersal of information for security, load balancing, and fault tolerance
Journal of the ACM (JACM)
Broadcasting in faulty binary jumping networks
Journal of Parallel and Distributed Computing
Hyper-ring connection machines
Parallel Computing
| Hi-index | 0.00 |
A graph G = (V,E) is called a hyper-ring with N nodes (N-HR for short) if V = {0, ...,N - 1} and E = {{u, v}|v - u modulo N is a power of 2}. The following results are shown. We prove that the node-connectivity 驴 of an N-HR is equal to its degree, say 驴, by presenting an algorithm for the explicit construction of 驴 node-disjoint paths connecting nodes s and t. The length of these paths is bounded by 驴logD驴 + 3, where D is the positional distance between s and t. Finally, we show a node-to-node communication scheme for HRs that requires only 驴logD驴 + 3 rounds, even in the presence of up to 驴-1 node failures.