Asymptotic dependence of average failure rate and MTTF for a recursive, meshed network architecture

The paper is concerned with the exact and asymptotic calculations of the availability, average failure rate and MTTF (Mean Time To Failure) for a recursive, meshed architecture proposed by Beichelt and Spross. It shows that the asymptotic size dependences of average failure rate and MTTF are different, but not inverse of each other, as is unfortunately assumed too frequently. Besides, the asymptotic limit is reached for rather small networks.