
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
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. 848857, July, 1992.  
BibTex  x  
@article{ 10.1109/12.256453, author = {M.A. Fiol and A.S. Llado}, title = {The Partial Line Digraph Technique in the Design of Large Interconnection Networks}, journal ={IEEE Transactions on Computers}, volume = {41}, number = {7}, issn = {00189340}, year = {1992}, pages = {848857}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.256453}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  The Partial Line Digraph Technique in the Design of Large Interconnection Networks IS  7 SN  00189340 SP848 EP857 EPD  848857 A1  M.A. Fiol, A1  A.S. Llado, PY  1992 KW  partial line digraph technique; design; large interconnection networks; distributed systems; maximum outdegree; routing; connectivity; expandability; Kautz digraphs; directed graphs; multiprocessor interconnection networks. VL  41 JA  IEEE Transactions on Computers ER   
The following problem arises in the design of some interconnection networks for distributed systems. Namely, to construct digraphs with given maximum outdegree, 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 socalled line digraph technique, allows digraphs that satisfy all the abovementioned 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 outdegree d and number of vertices N, for any N in the range d/sup D1/+d/sup D2/+. . .+1>or=N>or=d/sup D/+d/sup D1/.
[1] M. Aigner, "On the linegraph of a directed graph,"Math. Z., vol. 102, pp. 5661, 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. 130.
[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. 433449, 1986.
[4] K. Berrada, "Extension de Réseaux d'Interconnexion," Thesis, Univ. ParisSud, Orsay, 1986.
[5] W. G. Bridges and S. Toueg, "On the impossibility of directed Moore graphs,"J. Combin. Theory Ser. B, vol. 29, pp. 339341, 1980.
[6] N. G. de Bruijn, "A combinatorial problem,"Koninklijke Nederlandse Academie van Watenschappen Proc., vol. A49, pp. 758764, 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. 657668, 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. 4550.
[10] T. Y. Feng, "A survey of interconnection networks,"IEEE Comput. Mag., vol. 14, pp. 960965, 1981.
[11] M. A. Fiol, "Connectivity and superconnectivity of large graphs and digraphs,"Ars Combinatoria, vol. 29B, pp. 516, 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. 174177.
[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. 105122, 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. C33, pp. 400403, May 1984.
[15] D. Geller and F. Harary, "Connectivity in digraphs," inLecture Notes in Math., vol. 186. Berlin, Germany: Springer, 1970, pp. 105114.
[16] M. Imase and M. Itoh, "Design to minimize diameter on building block network,"IEEE Trans. Comput., vol. C30, pp. 439442, June 1981.
[17] M. Imase and M. Itoh, "A design for directed graphs with minimum diameter,"IEEE Trans. Comput., vol. C32, pp. 782784, Aug. 1983.
[18] M. Imase, T. Soneoka, and K. Okada, "Connectivity of regular directed graphs with small diameters,"IEEE Trans. Comput., vol. C34, pp. 267273, Mar. 1985.
[19] W. H. Kautz, "Bounds on directed (d,k) graphs," inTheory of Cellular Logic Networks and Machines, AFCRL680668 Final Rep., 1968, pp. 2028.
[20] W. H. Kautz, "Design of optimal interconnection networks for multiprocessors," inArchitecture and Design of Digital Computers, Nato Advanced Summer Institute, 1969, pp. 249272.
[21] G. Memmi and Y. Raillard, "Some new results about the (d,k) graph problem,"IEEE Trans. Comput., vol. C31, pp. 748791, Aug. 1982.
[22] J. Plesnik and S. Znám, "Strongly geodetic directed graphs,"Acta Fac. Rerum Natur. Univ. Comenian., Math. Publ., vol. 29, pp. 2934, 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. 10181026.
[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. C28, pp. 537542, July 1979.