Probabilistic and Combinatorial Analysis of Network Fault Tolerance Estimation Problem

Abstract

In this paper, we apply the probabilistic aspects of the birthday paradox to the problem asking when a router having two interfaces which do not work well appears firstly in a certain network. Exactly speaking, since it is difficult to observe or estimate network fault tolerance sequentially, we introduce some relations which enables to characterize the network faults of large-scale networks by those of small-scale ones.