The partial line digraph technique in the design of large interconnection networks

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 digr...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on computers Jg. 41; H. 7; S. 848 - 857
Hauptverfasser: Fiol, M.A., Llado, A.S.
Format: Journal Article Verlag
Sprache:Englisch
Veröffentlicht: New York, NY IEEE 01.07.1992
Institute of Electrical and Electronics Engineers
Schlagworte:
68 Computer science
68W Algorithms
Algorithms and computation in mathematics
Anàlisi matemàtica
Applied sciences
Classificació AMS
Communication networks
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Councils
Delay
Distributed computing
Exact sciences and technology
Fault tolerance
Intelligent networks
Matemàtiques i estadística
Multiprocessor interconnection networks
Proposals
Routing
Software
Very large scale integration
Àrees temàtiques de la UPC
Fault tolerance
Computer network
Shortest path
Routing
Computer system
Distributed system
Directed graph
Message transmission
ISSN:0018-9340
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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/.< >
Bibliographie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0018-9340
DOI:10.1109/12.256453