Title :
Incrementally extensible hypercube (IEH) graphs
Author :
Sur, Sumit ; Srimani, Pradip K.
Author_Institution :
Colorado State Univ., Fort Collins, CO, USA
Abstract :
The authors propose a new family of interconnection topology that can be used to design communication architectures for distributed systems with an arbitrary number of computing nodes. The design is based on a novel generalization of the well-known hypercube graphs. The proposed topology is shown to be incrementally extensible in steps of 1 and to be optimally fault tolerant, and its diameter is logarithmic in the number of nodes. For any given number of nodes, the difference of the maximum and the minimum degree of a node in the graph is >
Keywords :
fault tolerant computing; graph theory; hypercube networks; communication architectures; distributed systems; fault tolerant; hypercube graphs; incrementally extensible; interconnection topology; Bidirectional control; Communication networks; Computer networks; Delay; Distributed computing; Fault tolerance; Hypercubes; Mathematics; Network topology; Parallel processing;
Conference_Titel :
Computers and Communications, 1992. Conference Proceedings., Eleventh Annual International Phoenix Conference on
Conference_Location :
Scottsdale, AZ, USA
Print_ISBN :
0-7803-0605-8
DOI :
10.1109/PCCC.1992.200531
