DocumentCode
2035170
Title
Optimal Routing Algorithms for Generalized de Bruijn Digraphs
Author
Liu, Guoping ; Lee, Kyungsook Y.
Author_Institution
University of Denver, USA
Volume
3
fYear
1993
fDate
16-20 Aug. 1993
Firstpage
167
Lastpage
174
Abstract
Generalized de Bruijn digraph, G_{B}(d,n), was proposed independently by Imase and Itoh, and Reddy, Pradhan and Kuhl to include any number of nodes. Du and Hwang showed that G_{B}(d, n) essentially retains all the nice properties of de Bruijn digraphs, and presented a leftlceil {log _d n} rightrceil -step routing algorithm, where d is the indegree and outdegree, and n is the number of nodes in the graph.
Keywords
Communication networks; Computer science; Fault tolerance; Mathematics; Parallel processing; Routing; Average internode distance.; Fault-tolerant routing; Generalized de Bruijn daigraphs; Optimal routing algorithms;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel Processing, 1993. ICPP 1993. International Conference on
Conference_Location
Syracuse, NY, USA
ISSN
0190-3918
Print_ISBN
0-8493-8983-6
Type
conf
DOI
10.1109/ICPP.1993.130
Filename
4134264
Link To Document