This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Partial Line Digraph Technique in the Design of Large Interconnection Networks
July 1992 (vol. 41 no. 7)
pp. 848-857

The following problem arises in the design of some interconnection networks for distributed systems. Namely, to construct digraphs with given maximum out-degree, reduced diameter, easy routing, good connectivity, and good expandability. To this end, a method based on the concept of partial line digraph is presented. This proposal, which turns out to be a generalization of the so-called line digraph technique, allows digraphs that satisfy all the above-mentioned requirements to be obtained. In particular, it is shown that the partial line digraphs of Kautz digraphs solve the (d, N) digraph problem, i.e. to minimize the diameter D in a digraph of maximum out-degree d and number of vertices N, for any N in the range d/sup D-1/+d/sup D-2/+. . .+1>or=N>or=d/sup D/+d/sup D-1/.

[1] M. Aigner, "On the linegraph of a directed graph,"Math. Z., vol. 102, pp. 56-61, 1967.
[2] J.-C. Bermond, J. Bond, M. Paoli, and C. Peyrat, "Graphs and interconnection networks: Diameter and vulnerability,"London Math. Soc. Lec. Note Ser., vol. 82, Cambridge Univ. Press, 1983, pp. 1-30.
[3] J. C. Bermond, C. Delorme, and J. J. Quisquater, "Strategies for interconnection networks: Some methods from graph theory,"J. Parallel and Distributed Comput., vol. 3, pp. 433-449, 1986.
[4] K. Berrada, "Extension de Réseaux d'Interconnexion," Thesis, Univ. Paris-Sud, Orsay, 1986.
[5] W. G. Bridges and S. Toueg, "On the impossibility of directed Moore graphs,"J. Combin. Theory Ser. B, vol. 29, pp. 339-341, 1980.
[6] N. G. de Bruijn, "A combinatorial problem,"Koninklijke Nederlandse Academie van Watenschappen Proc., vol. A49, pp. 758-764, 1946.
[7] G. Chartrand and L. Lesniak,Graphs and Digraphs. Wadsworth, Monterey, 1986.
[8] J. Fàbrega and M. A. Fiol, "Maximally connected digraphs,"J. Graph Theory, vol. 13, pp. 657-668, 1989.
[9] J. Fàbrega, M. A. Fiol, and J. L. A. Yebra, "Connectivity and reliable routing algorithms in line digraphs," inProc. III IAESTED Int. Symp. Appl. Informatics, Grindelwald, Switzerland, 1985, pp. 45-50.
[10] T. Y. Feng, "A survey of interconnection networks,"IEEE Comput. Mag., vol. 14, pp. 960-965, 1981.
[11] M. A. Fiol, "Connectivity and superconnectivity of large graphs and digraphs,"Ars Combinatoria, vol. 29B, pp. 5-16, 1990.
[12] M. A. Fiol, I. Alegre, and J. L. A. Yebra, "Line digraph iterations and the (d,k) problem for directed graphs," inProc. 10th Int. Symp. Comput. Architecture, Stockholm, Sweden, 1983, pp. 174-177.
[13] M. A. Fiol, A. S. Lladó, and J. L. Villar, "Digraphs on alphabets and the (d,N) digraph problem,"Ars Combinatoria, vol. 25C, pp. 105-122, 1988.
[14] M. A. Fiol, J. L. A. Yebra, and I. Alegre, "Line digraph iterations and the (d,k) digraph problem,"IEEE Trans. Comput., vol. C-33, pp. 400-403, May 1984.
[15] D. Geller and F. Harary, "Connectivity in digraphs," inLecture Notes in Math., vol. 186. Berlin, Germany: Springer, 1970, pp. 105-114.
[16] M. Imase and M. Itoh, "Design to minimize diameter on building block network,"IEEE Trans. Comput., vol. C-30, pp. 439-442, June 1981.
[17] M. Imase and M. Itoh, "A design for directed graphs with minimum diameter,"IEEE Trans. Comput., vol. C-32, pp. 782-784, Aug. 1983.
[18] M. Imase, T. Soneoka, and K. Okada, "Connectivity of regular directed graphs with small diameters,"IEEE Trans. Comput., vol. C-34, pp. 267-273, Mar. 1985.
[19] W. H. Kautz, "Bounds on directed (d,k) graphs," inTheory of Cellular Logic Networks and Machines, AFCRL-68-0668 Final Rep., 1968, pp. 20-28.
[20] W. H. Kautz, "Design of optimal interconnection networks for multiprocessors," inArchitecture and Design of Digital Computers, Nato Advanced Summer Institute, 1969, pp. 249-272.
[21] G. Memmi and Y. Raillard, "Some new results about the (d,k) graph problem,"IEEE Trans. Comput., vol. C-31, pp. 748-791, Aug. 1982.
[22] J. Plesnik and S. Znám, "Strongly geodetic directed graphs,"Acta Fac. Rerum Natur. Univ. Comenian., Math. Publ., vol. 29, pp. 29-34, 1974.
[23] S. M. Reddy, J. G. Kuhl, S. H. Hosseini, and H. Lee, "On digraphs with minimum diameter and maximum connectivity," inProc. 20th Annu. Allerton Conf. Commun. Contr. Comput., 1982, pp. 1018-1026.
[24] S. M. Reddy, D. K. Pradhan, and J. Kuhl, "Directed graphs with minimum diameter and maximum connectivity," School Eng., Oakland Univ., Rochester, MI, Tech. Rep., July 1980.
[25] S. Toueg and K. Steiglitz, "The design of small diameter networks by local search,"IEEE Trans. Comput., vol. C-28, pp. 537-542, July 1979.

Index Terms:
partial line digraph technique; design; large interconnection networks; distributed systems; maximum out-degree; routing; connectivity; expandability; Kautz digraphs; directed graphs; multiprocessor interconnection networks.
Citation:
M.A. Fiol, A.S. Llado, "The Partial Line Digraph Technique in the Design of Large Interconnection Networks," IEEE Transactions on Computers, vol. 41, no. 7, pp. 848-857, July 1992, doi:10.1109/12.256453
Usage of this product signifies your acceptance of the Terms of Use.