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 (Formula presented.), where D is the positional distance between s and t. Finally, we show a node-to-node communication scheme for HRs that requires only (Formula presented.) rounds, even in the presence of up to δ−1 node failures.
CITATION STYLE
Altman, T., Igarashi, Y., & Motegi, K. (2002). Fast and dependable communication in hyper-rings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2387, pp. 350–359). Springer Verlag. https://doi.org/10.1007/3-540-45655-4_38
Mendeley helps you to discover research relevant for your work.