Abstract
Reliability and efficiency are important criteria in the design of interconnection networks. Connectivity is a widely used measurement for network fault-tolerance capacities, while diameter determines routing efficiency along individual paths. In practice, we are interested in high-connectivity, small-diameter networks. Recently, Hsu introduced the notion ofw-wide diameter, which unifies diameter and connectivity. This paper investigates thew-wide diameterd w (G) and two related parameters:w-fault diameterD w (G) andw-Rabin numberr w (G). In particular, we determined w (G) andD w (G) for 2≤w≤K(G) andG is a circulant digraphG(d n; ∈1,d,...,d n−1∉) or a cycle prefix digraph.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. C. Bermond (ed.), Interconnection Networks, Discrete Appl. Math.37/38 (1992) (special issue).
W.Y.C. Chen, V. Faber, and E. Knill, Restricted routing and wide diameter of the cycle prefix network, D.F. Hsu et al., Eds., DIMACS Ser. Discrete Math. Theoret. Comput. Sci.21 (1995) 31–46.
D.Z. Du, D.F. Hsu, and Y.D. Lyuu, On the diameter vulnerability of Kautz digraphs, Discrete Math.151 (1966) 81–85.
D.Z. Du, Y.D. Lyuu, and D.F. Hsu, Line digraph iteration and connectivity analysis of de Bruijn and Kautz graphs, IEEE Trans. Comput.42 (1993) 612–616.
A.H. Esfahanian and L. Halsimi, Fault-tolerant routing in de Bruijn communication networks, IEEE Trans. Comput.34 (1985) 777–788.
V. Faber and J.W. Moore, High-degree low-diameter interconnection networks with vertex symmetry: the directed case, Technical Report LA-UR-88-1051, Los Alamos National Laboratory, Los Alamos, New Mexico, 1988.
V. Faber, J.W. Moore, and W.Y.C. Chen, Cycle prefix digraphs for symmetric interconnection networks, Networks23 (1993) 641–649.
Y.O. Hamidoune, On the connectivity of Cayley digraphs, European J. Combin.5 (1984) 309–312.
D.F. Hsu (ed.), Interconnection Networks and Algorithms, Networks,23, John Wiley and Son, Inc., (1993) (special issue).
D.F. Hsu, On container width and length in graphs, groups, and networks, IEICE Trans. Fund. Elect., Commun. Comput. Sci.E77-A (1994) 668–680.
D.F. Hsu and T. Luczak, Note on thek-diameter ofk-regulark-connected graphs, Discrete Math.133 (1994) 291–296.
D.F. Hsu and Y.D. Lyuu, A graph theoretical study of transmission delay and fault tolerance, International Journal of Mini and Microcomputers16 (1994) 35–42.
M. Imase, T. Soneoka, and K. Okada, Fault-tolerant processor interconnection networks, Systems and Computers in Japan17 (1986) 21–30.
M. Jiang and F. Ruskey, Determining the Hamilton-connectedness of certain vertex-transitive graphs, Discrete Math.133 (1994) 159–169.
M.S. Krishnamoorthy and B. Krishnamurthy, Fault diameter of interconnection networks, Comput. Math. Appl.13 (1987) 577–582.
S. Latifi, Combinatorial analysis of the fault-diameter of then-cube, IEEE Trans. Comput.42 (1993) 27–33.
S. Latifi, On the fault-diameter of the star graph, Inform. Process. Lett.46 (1993) 143–150.
S.C. Liaw and G.J. Chang, Generalized diameters and Rabin numbers of networks, J. Combin. Optim. (to appear).
S.C. Liaw and G.J. Chang, Wide diameters of butterfly networks, Taiwanese J. Math. (to appear).
S.C. Liaw and G.J. Chang, Rabin numbers of butterfly networks, Discrete Math. (to appear).
F.J. Meyer and D.K. Pradhan, Flip-tree: fault-tolerant graphs with wide containers, IEEE Trans. Comput.37 (1988) 472–478.
E.T. Ordman, Fault-tolerant networks and graph connectivity, J. Combin. Math. Combin. Comput.1 (1987) 191–205.
M.O. Rabin, Efficient dispersal of information for security, load balancing, and fault tolerance, J. Assoc. Comput. Mach.36 (1989) 335–348.
S.M. Reddy, J.G. Kuhl, S.H. Hosslini, and H. Lee, On digraphs with minimum diameter and maximum connectivity, Proceedings of 20th Annual Allerton Conference on Communication, Control and Computing (Urbana-Champaign, Illinois, 1982), 1018–1026.
Author information
Authors and Affiliations
Additional information
Supported in part by the National Science Council under grant NSC86-2115-M009-002.
Rights and permissions
About this article
Cite this article
Liaw, SC., Chang, G.J., Cao, F. et al. Fault-tolerant routing in circulant networks and cycle prefix networks. Annals of Combinatorics 2, 165–172 (1998). https://doi.org/10.1007/BF01608486
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01608486