Performance, algorithmic, and robustness attributes of perfect difference networks

Perfect difference networks (PDNs) that are based on the mathematical notion of perfect difference sets have been shown to comprise an asymptotically optimal method for connecting a number of nodes into a network with diameter 2. Justifications for, and mathematical underpinning of, PDNs appear in a...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on parallel and distributed systems 2005-08, Vol.16 (8), p.725-736
Hauptverfasser:	Parhami, B., Rakov, M.A.
Format:	Artikel
Sprache:	eng
Schlagworte:	Bipartite graph chordal ring Computer networks Costs diameter Emulation Fault tolerance Hypercubes hyperstar interconnection network Joining processes Multiprocessor interconnection networks permutation routing robust network Robustness Routing routing algorithm Scalability Studies
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!