Reliability in layered networks with random link failures

We consider network reliability in layered networks where the lower layer experiences random link failures. In layered networks, each failure at the lower layer may lead to multiple failures at the upper layer. We generalize the classical polynomial expression for network reliability to the multi-layer setting. Using random sampling techniques, we develop polynomial time approximation algorithms for the failure polynomial. Our approach gives an approximate expression for reliability as a function of the link failure probability, eliminating the need to resample for different values of the failure probability. Furthermore, it gives insight on how the routings of the logical topology on the physical topology impact network reliability. We show that maximizing the min cut of the (layered) network maximizes reliability in the low failure probability regime. Based on this observation, we develop algorithms for routing the logical topology to maximize reliability.National Science Foundation (U.S.) (Grant CNS-0626781)National Science Foundation (U.S.) (Grant CNS-0830961)United States. Defense Threat Reduction Agency (Grant HDTRA1-07-1-0004)United States. Defense Threat Reduction Agency (Grant HDTRA-09-1-005