Generalized Diameters and Rabin Numbers of Networks

Reliability and efficiency are important criteria in the design of interconnection networks. Recently, the w-wide diameter dw(G), the (w − 1)-fault diameter Dw(G), and the w-Rabin number rw(G) have been used to measure network reliability and efficiency. In this paper, we study dw(G), Dw(G) and rw(G) using the strong w-Rabin number rw*(G) for 1 ≤ w ≤ k(G) and G is a circulant network G(dn; {1, d,..., dn−1}), a d-ary cube network C(d, n), a generalized hypercube GH(mn− 1,..., m0), a folded hypercube FH(n) or a WK-recursive network WK(d, t).

[1]  Michael O. Rabin,et al.  Efficient dispersal of information for security, load balancing, and fault tolerance , 1989, JACM.

[2]  Jywe-Fei Fang,et al.  Algorithms and Properties of a New Two-Level Network with Folded Hypercubes as Basic Modules , 1995, IEEE Trans. Parallel Distributed Syst..

[3]  Yuh-Dauh Lyuu,et al.  A graph-theoretical study of transmission delay and fault tolerance , 1994 .

[4]  Dharma P. Agrawal,et al.  Generalized Hypercube and Hyperbus Structures for a Computer Network , 1984, IEEE Transactions on Computers.

[5]  D. Frank Hsu,et al.  On the k-diameter of k-regular k-connected graphs , 1994, Discret. Math..

[6]  Gen-Huey Chen,et al.  On the Rabin number problem , 1997, Networks.

[7]  D. Frank Hsu,et al.  Fault-tolerant routing in circulant networks and cycle prefix networks , 1998 .

[8]  C. Sanges,et al.  A recursively scalable network VLSI implementation , 1988, Future Gener. Comput. Syst..

[9]  M. Krishnamoorthy,et al.  Fault diameter of interconnection networks , 1987 .

[10]  Gen-Huey Chen,et al.  Topological properties, communication, and computation on WK-recursive networks , 1994, Networks.

[11]  D. Frank Hsu,et al.  Combinatorial Properties of Generalized Hypercube Graphs , 1996, Inf. Process. Lett..

[12]  D.Frank Hsu,et al.  On Container Width and Length in Graphs, Groups,and Networks--Dedicated to Professor Paul Erdös on the occasion of his 80th birthday-- , 1994 .

[13]  Shahram Latifi,et al.  Properties and Performance of Folded Hypercubes , 1991, IEEE Trans. Parallel Distributed Syst..

[14]  Gerard J. Chang,et al.  WIDE DIAMETERS OF BUTTERFLY NETWORKS , 1999 .

[15]  Yahya Ould Hamidoune,et al.  On the Connectivity of Cayley Digraphs , 1984, Eur. J. Comb..