Abstract
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).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
L.N. Bhuyan and D.P. Agrawal, “Generalized hypercube and hyperbus structures for a computer network,” IEEE Transactions on Computers, vol. C-33, pp. 323–333, 1984.
G.H. Chen and D.R. Duh, “Topological properties, communication and computation on WK-recursive networks,” Networks, vol. 24, pp. 303–317, 1994.
D.R. Duh and G.H. Chen, “On the Rabin number problem,” Networks, vol. 30, pp. 219–230, 1997.
D.R. Duh, G.H. Chen, and J.F. Fang, “Algorithms and properties of a new two-level network with folded hypercubes as basic modules,” IEEE Transactions on Parallel and Distributed Systems, vol. 6, pp. 714–723, 1995.
D.R. Duh, G.H. Chen, and D.F. Hsu, “Combinatorial properties of generalized hypercube graphs,” Information Processing Letters, vol. 57, pp. 41–5, 1996.
A. El-Amawy and S. Latifi, “Properties and performance of folded hypercubes,” IEEE Transactions on Parallel and Distributed Systems, vol. 2, pp. 31–42, 1991.
Y.O. Hamidoune, “On the connectivity of Cayley digraphs,” European J. Combinatorics, vol. 5, pp. 309–312, 1984.
D.F. Hsu, “On container width and length in graphs, groups, and networks,” IEICE Transaction on Fundamentals of Electronics, Communications and Computer Science, vol. E77–A, pp. 668–680, 1994.
D.F. Hsu and T. Luczak, “Note on the k-diameter of k-regular k-connected graphs,” Discrete Mathematics, vol. 133, pp. 291–296, 1994.
D.F. Hsu and Y.D. Lyuu, “A graph theoretical study of transmission delay and fault tolerance,” International Journal of Mini and Microcomputers, vol. 16, pp. 35–42, 1994.
M.S. Krishnamoorthy and B. Krishnamurthy, “Fault diameter of interconnection networks,” Computers and Mathematics with Applications, vol. 13, pp. 577–582, 1987.
S.C. Liaw, F. Cao, G.J. Chang, and D.F. Hsu, “Fault-tolerant routing in circulant networks and cycle prefix networks,” Annals of Combinatorics, vol. 2, 1998.
S.C. Liaw and G.J. Chang, “Wide diameters of butterfly networks,” Taiwanese Journal of Mathematics, to appear.
M.O. Rabin, “Efficient dispersal of information for security, load balancing, and fault tolerance,” J. Association for Computing Machinery, vol. 36, pp. 335–348, 1989.
G. Della Vecchia and C. Sanges, “A recursively scalable network VLSI implementation,” Future Generations Computer Systems, vol. 4, pp. 235–243, 1988.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Liaw, SC., Chang, G.J. Generalized Diameters and Rabin Numbers of Networks. Journal of Combinatorial Optimization 2, 371–384 (1998). https://doi.org/10.1023/A:1009728720073
Issue Date:
DOI: https://doi.org/10.1023/A:1009728720073