DocumentCode :
2626614
Title :
A class of hypercube-like networks
Author :
Vaidya, Aniruddha S. ; Rao, P. S Nagendra ; Shankar, S. Ravi
Author_Institution :
Dept. of Electr. Eng., Indian Inst. of Sci., Bangalore, India
fYear :
1993
fDate :
1-4 Dec 1993
Firstpage :
800
Lastpage :
803
Abstract :
We introduce a class of graphs which are variants of the hypercube graph. Many of the properties of this class of graphs are similar to that of the hypercube hence, we refer to them as the class of hypercube-like graphs/networks. We show that the hypercube, the twisted n-cube and the multiply-twisted cube are members of this class of graphs. We also propose simple strategies for distributed routing and broadcast and discuss some issues regarding embedding other graphs and reconfiguration in such networks
Keywords :
graph theory; hypercube networks; parallel architectures; reconfigurable architectures; topology; distributed routing; hypercube graph; hypercube-like networks; multiply-twisted cube; reconfiguration; twisted n-cube; Broadcasting; Hamming distance; Hypercubes; Labeling; Network topology; Routing; Scalability; Terminology;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel and Distributed Processing, 1993. Proceedings of the Fifth IEEE Symposium on
Conference_Location :
Dallas, TX
Print_ISBN :
0-8186-4222-X
Type :
conf
DOI :
10.1109/SPDP.1993.395450
Filename :
395450
Link To Document :
بازگشت