A New Family of Cayley Graph Interconnection Networks of Constant Degree Four

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.

[1]  Dharma P. Agrawal,et al.  dBCube: A New Class of Hierarchical Multiprocessor Interconnection Networks with Area Efficient Layout , 1993, IEEE Trans. Parallel Distributed Syst..

[2]  Dharma P. Agrawal,et al.  Generalized Hypercube and Hyperbus Structures for a Computer Network , 1984, IEEE Transactions on Computers.

[3]  Gunnar E. Carlsson,et al.  Interconnection Networks Based on a Generalization of Cube-Connected Cycles , 1985, IEEE Transactions on Computers.

[4]  Selim G. Akl,et al.  Decomposing a Star Graph Into Disjoint Cycles , 1991, Inf. Process. Lett..

[5]  Franco P. Preparata,et al.  The cube-connected-cycles: A versatile network for parallel computation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[6]  K. Wendy Tang,et al.  Representations and routing for Cayley graphs [computer networks] , 1991, IEEE Trans. Commun..

[7]  Shimon Even,et al.  Graph Algorithms , 1979 .

[8]  Robert E. Tarjan,et al.  Network Flow and Testing Graph Connectivity , 1975, SIAM J. Comput..

[9]  Marvin H. Solomon,et al.  Dense Trivalent Graphs for Processor Interconnection , 1982, IEEE Transactions on Computers.

[10]  S. Lakshmivarahan,et al.  Symmetry in Interconnection Networks Based on Cayley Graphs of Permutation Groups: A Survey , 1993, Parallel Comput..

[11]  Isaac D. Scherson,et al.  Orthogonal Graphs for the Construction of a Class of Interconnection Networks , 1994, IEEE Trans. Parallel Distributed Syst..

[12]  M. H. Schultz,et al.  Topological properties of hypercubes , 1988, IEEE Trans. Computers.

[13]  Dhiraj K. Pradhan,et al.  The De Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI , 1989, IEEE Trans. Computers.

[14]  Dhiraj K. Pradhan,et al.  A Fault-Tolerant Communication Architecture for Distributed Systems , 1982, IEEE Transactions on Computers.

[15]  Sheldon B. Akers,et al.  The Star Graph: An Attractive Alternative to the n-Cube , 1994, ICPP.

[16]  Frank Harary,et al.  Graph Theory , 2016 .

[17]  Khaled Day,et al.  Arrangement Graphs: A Class of Generalized Star Graphs , 1992, Inf. Process. Lett..

[18]  Sheldon B. Akers,et al.  A Group-Theoretic Model for Symmetric Interconnection Networks , 1989, IEEE Trans. Computers.

[19]  Dhiraj K. Pradhan,et al.  Fault-Tolerant VLSI Architectures Based on de Bruijn Graphs (Galileo in the Mid Nineties) , 1989, Reliability Of Computer And Communication Networks.

[20]  Arunabha Sen,et al.  On Fault-Tolerant Distributor Communication Architecture , 1986, IEEE Transactions on Computers.

[21]  Selim G. Akl,et al.  On Some Properties and Algorithms for the Star and Pancake Interconnection Networks , 1994, J. Parallel Distributed Comput..