This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Locally Subcube-Connected Hypercube Networks: Theoretical Analysis and Experimental Results
May 2002 (vol. 51 no. 5)
pp. 530-540
ASCII Text
x 
 
J. Chen, G. Wang, S. Chen, "Locally Subcube-Connected Hypercube Networks: Theoretical Analysis and Experimental Results," IEEE Transactions on Computers, vol. 51, no. 5, pp. 530-540, May, 2002.
 
 
BibTex
x
 
@article{ 10.1109/TC.2002.1004592,
author = {J. Chen and G. Wang and S. Chen},
title = {Locally Subcube-Connected Hypercube Networks: Theoretical Analysis and Experimental Results},
journal ={IEEE Transactions on Computers},
volume = {51},
number = {5},
issn = {0018-9340},
year = {2002},
pages = {530-540},
doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2002.1004592},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Computers
TI - Locally Subcube-Connected Hypercube Networks: Theoretical Analysis and Experimental Results
IS - 5
SN - 0018-9340
SP530
EP540
EPD - 530-540
A1 - J. Chen,
A1 - G. Wang,
A1 - S. Chen,
PY - 2002
KW - Interconnection network
KW - hypercube
KW - routing algorithm
KW - fault tolerance
VL - 51
JA - IEEE Transactions on Computers
ER -
 

We study hypercube networks with a very large number of faulty nodes. A simple and natural condition, the local subcube-connectivity, is identified under which hypercube networks with a very large number of faulty nodes still remain connected. The condition of local subcube-connectivity can be detected and maintained in a distributed manner based on localized management. Efficient routing algorithms on locally subcube-connected hypercube networks are developed. Our algorithms are distributed and local-information-based in the sense that each node in the network knows only its neighbors' status and no global information of the network is required by the algorithms. For a locally subcube-connected hypercube network that may contain up to 37.5 percent faulty nodes, our algorithms run in linear time and, for any two given nonfaulty nodes, find a routing path of length bounded by four times the Hamming distance between the two nodes. Theoretical analysis and experimental results are presented which show that, under a variety of probability distributions of node failures, hypercube networks are locally subcube-connected with a very high probability and our routing algorithms run in linear time and construct routing paths of nearly optimal length.

[1] S.B. Akers and B. Krishnamurthy, “A Group-Theoretic Model for Symmetric Interconnection Networks,” IEEE Trans. Computers, vol. 38, no. 4, pp. 555-566, Apr. 1989.
[2] J. Chen, G. Wang, and S. Chen, “Routing in Hypercube Networks with a Constant Fraction of Faulty Nodes,” Proc. Fourth Int'l Conf. Algorithms and Architecture for Parallel Processing (ICA3PP 2000), pp. 605-616, 2000.
[3] M.S. Chen and K.G. Shin, "Depth-First Search Approach for Fault-Tolerant Routing in Hypercube Multicomputers," IEEE Trans. Parallel and Distributed Systems, vol. 1, no. 2, pp. 152-159, Apr. 1990.
[4] T.C. Lee and J.P. Hayes,“A fault-tolerant communication scheme for hypercube computers,” IEEE Trans. Computers, vol. 41, no. 10, pp. 1,242-1,256, Oct. 1992.
[5] G.M. Chiu and S.P. Wu, "A Fault-Tolerant Routing Strategy in Hypbercube Multicomputers," IEEE Trans. Computers, vol. 45, no. 2, pp. 143-156, Feb. 1996.
[6] A.L. DeCegama, The Technology of Parallel Processing—Parallel Processing Architectures and VLSI Hardware, vol. 1. Prentice Hall, 1989.
[7] A.H. Esfahanian, “Generalized Measures of Fault Tolerance with Application to n-Cube Networks,” IEEE Trans. Computers, vol. 38, no. 11, pp. 1,586-1,591, 1989.
[8] Q.-P. Gu and S. Peng, “Optimal Algorithms for Node-to-Node Fault Tolerant Routing in Hypercubes,” The Computer J., vol. 39, pp. 626-629, 1996.
[9] Q.P. Gu and S. Peng, “k-Pairwise Cluster Fault Tolerant Routing in Hypercubes,” IEEE Trans. Computers, vol. 46, no. 9, pp. 1042-1049, Sept. 1997.
[10] Q -P. Gu and S. Peng, “Unicast in Hypercubes with Large Number of Faulty Nodes,” IEEE Trans. Parallel and Distributed Systems, vol. 10, pp. 964-975, 1999.
[11] Q.-P. Gu and S. Peng, “An Efficient Algorithm for thek-Pairwise Disjoint Paths Problem in Hypercubes,” J. Parallel and Distributed Computing, vol. 60, pp. 764-774, 2000.
[12] Intel Corp., Intel iPSC System Overview, Jan. 1986.
[13] S. Latifi, “Combinatorial Analysis of the Fault Diameter of the$n$-Cube,” IEEE Trans. Computers, vol. 42, no.1, pp. 27-33, 1993.
[14] S. Latifi, M. Hedge, and M. Naraghi-Pour, “Conditional Connectivity Measures for Large Multipprocessor Systems,” IEEE Trans. Computers, vol. 43, no. 2, pp. 218-222, 1994.
[15] F.T. Leighton,Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes.San Mateo, Calif.: Morgan Kaufmann, 1992.
[16] W. Najjar and J.L. Gaudiot, “Network Resilience: A Measure of Network Fault Tolerance,” IEEE Trans. Computers, vol. 39, pp. 174-181, 1990.
[17] NCUBE Corp., NCUBE/ten: An Overview, Beaverton, Ore., Nov. 1985.
[18] M.O. Rabin, Efficient Dispersal of Information for Security, Load Balancing and Fault Tolerance J. ACM, vol. 36, no. 2, pp. 335-348, 1989.
[19] S.-B. Tien and C.S. Raghavendra,“Algorithms and bounds for shortest paths and diameter in faultyhypercubes,” IEEE Trans. Parallel and Distributed Systems, pp. 713-718, June 1993.
[20] A. Wagner and D. Corneil,“Embedding trees in a hypercube is NP-complete,” SIAM J. Computing, vol. 19, no. 3, pp. 570-590, June 1990.
[21] J. Wu, "Unicasting in Faulty Hypercubes Using Safety Levels," IEEE Trans. Computers, vol. 46, no. 2, pp. 241-247, Feb. 1997.

Index Terms:
Interconnection network, hypercube, routing algorithm, fault tolerance
Citation:
J. Chen, G. Wang, S. Chen, "Locally Subcube-Connected Hypercube Networks: Theoretical Analysis and Experimental Results," IEEE Transactions on Computers, vol. 51, no. 5, pp. 530-540, May 2002, doi:10.1109/TC.2002.1004592
Usage of this product signifies your acceptance of the Terms of Use.