Hypercube Network Fault Tolerance: A Probabilistic Approach
Academic Article
Overview
Identity
Additional Document Info
Other
View All
Overview
abstract
Extensive experiments and experience have shown that the well-known hypercube networks are highly fault tolerant. What is frustrating is that it seems very difficult to properly formulate and formally prove this important fact, despite extensive research efforts in the past two decades. Most proposed fault tolerance models for hypercube networks are only able to characterize very rare extreme situations thus significantly underestimating the fault tolerance power of hypercube networks, while for more realistic fault tolerance models, the analysis becomes much more complicated. In this paper, we develop new techniques that enable us to analyze a more realistic fault tolerance model and derive lower bounds for the probability of hypercube network fault tolerance in terms of node failure probability. Our results are both theoretically significant and practically important. From the theoretical point of view, our method offers very general and powerful techniques for formally proving lower bounds on the probability of network connectivity, while from the practical point of view, our results provide formally proven and precisely given upper bounds on node failure probabilities for manufacturers to achieve a desired probability for network connectivity. Our techniques are also useful and powerful for analysis of the performance of routing algorithms, and applicable to the study of other hierarchical network structures and to other network communication problems.
