This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Reliable Unicasting in Faulty Hypercubes Using Safety Levels
February 1997 (vol. 46 no. 2)
pp. 241-247

Abstract—We propose a unicasting algorithm for faulty hypercubes (including disconnected hypercubes) using the safety level concept. A faulty hypercube is a hypercube with faulty nodes and unicasting is a one-to-one communication between two nodes in the hypercube. Each node is associated with a safety level which is an approximated measure of the number and distribution of faulty nodes in the neighborhood. The safety level of each node in an n-dimensional hypercube (or n-cube) can be easily calculated through n− 1 rounds of information exchange among neighboring nodes. Optimal unicasting between two nodes is guaranteed if the safety level of the source node is no less than the Hamming distance between the source and the destination. The proposed unicasting algorithm can also be used in disconnected hypercubes, where nodes in a hypercube are disjointed into two or more parts. The feasibility of an optimal or suboptimal unicasting can by easily determined at the source node by comparing its safety level, its neighbors' safety levels, and the Hamming distance between the source and the destination. The proposed scheme is the first attempt to address the unicasting problem in disconnected hypercubes. The safety level concept is also extended to be used in hypercubes with both faulty nodes and links and in generalized hypercubes.

[1] L.N. Bhuyan and D.P. Agrawal, "Generalized Hypercube and Hyperbus Structures for a Computer Network," IEEE Trans. Computers, vol. 32, no. 4, pp. 323-333, Apr. 1984.
[2] M.-S. Chen and K.G. Shin, "Adaptive Fault-Tolerant Routing in Hypercube Multicomputers," IEEE Trans. Computers, vol. 39, no. 12, pp. 1,406-1,416, Dec. 1990.
[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] 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.
[5] J.M. Gordon and Q.F. Stout, “Hypercube Message Routing in the Presence of Faults,” Proc. Third Conf. Hypercube Concurrent Computers and Applications, pp. 318-327, Jan. 1988.
[6] Y. Lan, "A Fault-Tolerant Routing Algorithm in Hypercubes," Proc. 1994 Int'l Conf. Parallel Processing, pp. III 163-III 166, Aug. 1994.
[7] 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.
[8] C.S. Raghavendra,P.-J. Yang,, and S.-B. Tien,“Free dimensions—an effective approach to achieving fault tolerance in hypercubes,” 22nd Ann. Int’l Symp. Fault-Tolerant Computing, pp. 170-177, 1992.
[9] J. Wu, “Safety Levels—An Efficient Mechanism for Achieving Reliable Broadcasting in Hypercubes,” IEEE Trans. Computers, vol. 44, no. 5, pp. 702-706, May 1995.
[10] J. Wu and E.B. Fernandez, "Reliable Broadcasting in Faulty Hypercube Computers," Microprocessing and Microprogramming, vol. 39, pp. 43-53, 1993.

Index Terms:
Disconnected networks, fault tolerance, hypercubes, reliable communication, unicast.
Citation:
Jie Wu, "Reliable Unicasting in Faulty Hypercubes Using Safety Levels," IEEE Transactions on Computers, vol. 46, no. 2, pp. 241-247, Feb. 1997, doi:10.1109/12.565613
Usage of this product signifies your acceptance of the Terms of Use.