Solving advanced network reliability problems by means of cellular automata and Monte Carlo sampling

This paper extends the cellular automata-based, Monte Carlo sampling methodology for computing network reliability, previously proposed by the first author. The extension regards the development of cellular automata for the solution of the all-terminal and k-terminal connection problems and the maximum unsplittable flow problem, which can be considered as a particular, simplified case of the maximum flow distribution problem. The algorithms developed are presented in detail and verified on literature cases.