On fault tolerance of 3-dimensional mesh networks

  • Authors:

  • Gao-Cai Wang;Jian-Er Chen;Guo-Jun Wang

  • Affiliations:

  • College of Information Science and Engineering, Central South University, Changsha 410083, P.R. China and School of Computer and Electrical Information, Guangxi University, Nanning 530004, P.R. Ch ...;College of Information Science and Engineering, Central South University, Changsha 410083, P.R. China and Department of Computer Science, Texas A&M University;College of Information Science and Engineering, Central South University, Changsha 410083, P.R. China

  • Venue:
  • Journal of Computer Science and Technology
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, the concept of k-submesh and k-submesh connectivity fault tolerance model is proposed. And the fault tolerance of 3-D mesh networks is studied under a more realistic model in which each network node has an independent failure probability. It is first observed that if the node failure probability is fixed, then the connectivity probability of 3-D mesh networks can be arbitrarily small when the network size is sufficiently large. Thus, it is practically important for multicomputer system manufacturer to determine the upper bound for node failure probability when the probability of network connectivity and the network size are given. A novel technique is developed to formally derive lower bounds on the connectivity probability for 3-D mesh networks. The study shows that 3-D mesh networks of practical size can tolerate a large number of faulty nodes thus are reliable enough for multicomputer systems. A number of advantages of 3-D mesh networks over other popular network topologies are given. Compared to 2-D mesh networks, 3-D mesh networks are much stronger in tolerating faulty nodes, while for practical network size, the fault tolerance of 3-D mesh networks is comparable with that of hypercube networks but enjoys much lower node degree.