The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - January (1996 vol.7)
pp: 26-32
ABSTRACT
<p><b>Abstract</b>—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.</p>
INDEX TERMS
Interconnection network, Cayley graph, constant degree, fault tolerance, generators, simple routing, optimal routing.
CITATION
Premkumar Vadapalli, Pradip K. Srimani, "A New Family of Cayley Graph Interconnection Networks of Constant Degree Four", IEEE Transactions on Parallel & Distributed Systems, vol.7, no. 1, pp. 26-32, January 1996, doi:10.1109/71.481595
21 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool