DocumentCode
1243761
Title
A new family of Cayley graph interconnection networks of constant degree four
Author
Vadapalli, Premkumar ; Srimani, Pradip K.
Author_Institution
Tartan Labs., Pittsburgh, PA, USA
Volume
7
Issue
1
fYear
1996
fDate
1/1/1996 12:00:00 AM
Firstpage
26
Lastpage
32
Abstract
We propose a new family of interconnection networks that are Cayley graphs with constant node degree 4. These graphs are regular, have logarithmic diameter, and are maximally fault tolerant. We investigate different algebraic properties of these networks (including fault tolerance) and propose optimal routing algorithms. As far as we know, this is the first family of Cayley graphs of constant degree 4
Keywords
algebra; fault tolerant computing; graph theory; multiprocessor interconnection networks; network routing; parallel algorithms; Cayley graph interconnection networks; algebraic properties; constant node degree four Cayley graphs; logarithmic diameter graphs; maximally fault tolerant graphs; optimal routing algorithms; regular graphs; Bibliographies; Fault tolerance; Hypercubes; Laboratories; Multiprocessor interconnection networks; Network topology; Parallel processing; Routing; Senior members; Very large scale integration;
fLanguage
English
Journal_Title
Parallel and Distributed Systems, IEEE Transactions on
Publisher
ieee
ISSN
1045-9219
Type
jour
DOI
10.1109/71.481595
Filename
481595
Link To Document