Calibrating a dependent failure model for computing reliabilities in telecommunication networks

In this work, we propose a methodology for calibrating a dependent failure model to compute the reliability in a telecommunication network. We use the Marshall-Olkin (MO) copula model, which captures failures that arise simultaneously in groups of links. In practice, this model is difficult to calibrate because it requires the estimation of a number of parameters that is exponential in the number of links. We formulate an optimization problem for calibrating an MO copula model to attain given marginal failure probabilities for all links and the correlations between them. Using a geographic failure model, we calibrate various MO copula models using our methodology, we simulate them, and we benchmark the reliabilities thus obtained. Our experiments show that considering the simultaneous failures of small and connected subsets of links is the key to obtaining a good approximation of reliability, confirming what is suggested by the telecommunication literature.

[1]  Pirkko Kuusela,et al.  Analysis of Dependencies between Failures in the UNINETT IP Backbone Network , 2010, 2010 IEEE 16th Pacific Rim International Symposium on Dependable Computing.

[2]  T. V. McEvilly Seismicity of the earth and associated phenomena , 1967 .

[3]  Stefan Savage,et al.  California fault lines: understanding the causes and impact of network failures , 2010, SIGCOMM '10.

[4]  Héctor Cancela,et al.  Topological optimization of reliable networks under dependent failures , 2015, Oper. Res. Lett..

[5]  Tov Elperin,et al.  Estimation of network reliability using graph evolution models , 1991 .

[6]  Nozer D. Singpurwalla Dependence in network reliability , 2002, Proceedings of the Fifth International Conference on Information Fusion. FUSION 2002. (IEEE Cat.No.02EX5997).

[7]  George B. Dantzig,et al.  Decomposition Principle for Linear Programs , 1960 .

[8]  Bruno Tuffin,et al.  Static Network Reliability Estimation under the Marshall-Olkin Copula , 2015, ACM Trans. Model. Comput. Simul..

[9]  GillPhillipa,et al.  Understanding network failures in data centers , 2011 .

[10]  J. Scott Provan,et al.  The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected , 1983, SIAM J. Comput..

[11]  F. Al-Shamali,et al.  Author Biographies. , 2015, Journal of social work in disability & rehabilitation.

[12]  H. Block Multivariate Exponential Distribution , 2006 .

[13]  Gil Zussman,et al.  The Resilience of WDM Networks to Probabilistic Geographical Failures , 2011, IEEE/ACM Transactions on Networking.

[14]  Chen-Nee Chuah,et al.  Characterization of Failures in an Operational IP Backbone Network , 2008, IEEE/ACM Transactions on Networking.