Probabilistic Analysis of Connectivity on Mesh Networks Conference Paper uri icon

abstract

  • 2003 IEEE. Mesh networks are among the most important network topologies in massive multiprocessor parallel systems. This paper proposes a new method for calculating the connectivity probability for mesh networks, which uses thorough mathematical methods to derive the relationship between the network node failure probability and the network connectivity probability in mesh networks. The results show that practical mesh networks can remain connected with very high probability. For example, it is formally proved that when the network node failure probability is bounded by 0.12%, the mesh networks with up to forty thousand nodes remain connected with probability larger than 99%. Our methods are also useful for deriving lower bounds on the connectivity probability for other computer networks.

name of conference

  • Proceedings ITCC 2003. International Conference on Information Technology: Coding and Computing

published proceedings

  • Proceedings ITCC 2003. International Conference on Information Technology: Coding and Computing

author list (cited authors)

  • Wang, G., Chen, J., & Wang, G.

citation count

  • 2

complete list of authors

  • Wang, Gaocai||Chen, Jianer||Wang, Guojun

publication date

  • January 2003