This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Diagnosability of t-Connected Networks and Product Networks under the Comparison Diagnosis Model
December 2004 (vol. 53 no. 12)
pp. 1582-1590
Diagnosability is an important factor in measuring the reliability of an interconnection network, while the (node) connectivity is used to measure the fault tolerance of an interconnection network. We observe that there is a close relationship between the connectivity and the diagnosability. According to our results, a t-regular and t-connected network with at least 2t + 3 nodes is t--diagnosable. Furthermore, the diagnosability of the product networks is also investigated in this work. The product networks, including hypercube, mesh, and tori, comprise very important classes of interconnection networks. Herein, different combinations of t--diagnosable and t-connected are employed to study the diagnosability of the product networks.

[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] T. Araki and Y. Shibata, “Diagnosability of Networks by the Cartesian Product,” IEICE Trans. Fundamentals, vol. E83, A. no. 3, pp. 465-470, 2000.
[3] B. Bose, B. Broeg, Y. Kwon, and Y. Ashir, “Lee Distance and Topological Properties of k-Ary n-Cubes,” IEEE Trans. Computers, vol. 44, no. 8, pp. 1,021-1,030, Aug. 1995.
[4] L.N. Bhuyan and D.P. Agrawal, “Generalized Hypercube and Hyperbus Structures for a Computer Network,” IEEE Transactions on Computers, vol. 33, no. 4, pp. 323-333, Apr. 1984.
[5] K. Day and A.-E. Al-Ayyoub, “The Cross Product of Interconnection Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 2, no. 2, pp. 109-118, 1991.
[6] K. Day and A.-E. Al-Ayyoub, “Minimal Fault Diameter for Highly Resilient Product Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 11, no. 9, pp. 926-930, Sept. 2000.
[7] J.A. Mchugh, Algorithmic Graph Theorey. Prentice Hall Int'l, 1990.
[8] K. Efe and A. Fernandez, “Products of Networks with Logarithmic Diameters and Fixed Degree,” IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 9, pp. 963-975, Sept. 1995.
[9] J. Fan, “Diagnosability of Crossed Cubes under the Comparison Diagnosis Model,” IEEE Trans. Parallel and Distributed Systems, vol. 13, no. 10, pp. 1,099-1,104, Oct. 2002.
[10] T. El-Ghazawi and A. Youssef, “A Generalized Framework for Developing Adaptive Fault-Tolerant Routing Algorithms,” IEEE Trans. Reliability, vol. 42, no. 2, pp. 250-258, 1993.
[11] T. El-Ghazawi and A. Youssef, “A Unified Approach to Fault-Tolerant Routing,” Proc. 1992 Int'l Conf. Distributed Computing Systems, pp. 210-217, 1992.
[12] A. Kavianpour and K.H. Kim, “Diagnosability of Hypercube under the Pessimistic One-Step Diagnosis Strategy,” IEEE Trans. Computers, vol. 40, no. 2, pp. 232-237, Feb. 1991.
[13] P.L. Lai, J.J.M. Tan, C.H. Tsai, and L.H. Hsu, “The Diagnosability of Matching Composition Network under the Comparison Diagnosis Model,” IEEE Trans. Computers, accepted.
[14] J. Maeng and M. Malek, “A Comparsion Connection Assignment for Self-Diagnosis of Multiprocessor System,” Proc. 11th Int'l Symp. Fault-Tolerant Computing, pp. 173-175, 1981.
[15] M. Malek, “A Comparsion Connection Assignment for Diagnosis of Multiprocessor System,” Proc. Seventh Int'l Symp. Computer Architecture, pp. 31-35, 1980.
[16] S. Ohring and S.K. Das, “Folded Petersen Cube Networks: New Competitors for Hypercubes,” IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 2, pp. 151-168, Feb. 1996.
[17] S. Ohring and D.H. Hohndel, “Optimal Fault Tolerant Communication Algorithms on Product Networks Using Spanning Trees,” Proc. Sixth IEEE Symp. Parallel and Distributed Processing, pp. 188-195, 1994.
[18] F.P. Preparata, G. Metze, and R.T. Chien, “On the Connection Assignment Problem of Diagnosis Systems,” IEEE Trans. Electronic Computers, vol. 16, no. 12, pp. 848-854, Dec. 1967.
[19] A.L. Rosenberg, “Product-Shuffle Networks: Towards Reconciling Shuffles and Butterflies,” Discrete Applied Math., vols. 37/38, pp. 465-488, 1992.
[20] A. Sengupta and A. Dahbura, “On Self-Diagnosable Multiprocessor System: Diagnosis by the Comparison Approach,” IEEE Trans. Computers, vol. 41, no. 11, pp. 1,386-1,396, 1992.
[21] D. Wang, “Diagnosability of Enhanced Hypercubes,” IEEE Trans. Computers, vol. 43, no. 9, pp. 1,054-1,061, Sept. 1994.
[22] D. Wang, “Diagnosability of Hypercubes and Enhanced Hypercubes under the Comparison Diagnosis Model,” IEEE Trans. Computers, vol. 48, no. 12, pp. 1,369-1,374, Dec. 1999.
[23] A. Youssef, “Design and Analysis of Product Networks,” Proc. Frontiers '95, pp. 521-528, 1995.

Index Terms:
Diagnosability, comparison diagnosis model, t-diagnosable, connectivity, order graph, product networks.
Citation:
Chien-Ping Chang, Pao-Lien Lai, Jimmy Jiann-Mean Tan, Lih-Hsing Hsu, "Diagnosability of t-Connected Networks and Product Networks under the Comparison Diagnosis Model," IEEE Transactions on Computers, vol. 53, no. 12, pp. 1582-1590, Dec. 2004, doi:10.1109/TC.2004.114
Usage of this product signifies your acceptance of the Terms of Use.