Hostname: page-component-78c5997874-xbtfd Total loading time: 0 Render date: 2024-11-13T10:20:34.807Z Has data issue: false hasContentIssue false
  • English
  • Français

MARKOV CHAIN METHOD FOR COMPUTING THE RELIABILITY OF HAMMOCK NETWORKS

Published online by Cambridge University Press:  20 November 2020

Marilena Jianu Open the ORCID record for Marilena Jianu [Opens in a new window] ,
Daniel Ciuiu ,
Leonard Dăuş  and
Mihail Jianu
Marilena Jianu
Affiliation:
Department of Mathematics and Computer Science, Technical University of Civil Engineering of Bucharest, Blvd. Lacul Tei, 124, 020396Bucharest, Romania E-mail: [email protected]; E-mail: [email protected]; E-mail: [email protected]
Daniel Ciuiu
Affiliation:
Department of Mathematics and Computer Science, Technical University of Civil Engineering of Bucharest, Blvd. Lacul Tei, 124, 020396Bucharest, Romania E-mail: [email protected]; E-mail: [email protected]; E-mail: [email protected]
Leonard Dăuş
Affiliation:
Department of Mathematics and Computer Science, Technical University of Civil Engineering of Bucharest, Blvd. Lacul Tei, 124, 020396Bucharest, Romania E-mail: [email protected]; E-mail: [email protected]; E-mail: [email protected]
Mihail Jianu
Affiliation:
St Catherine's College, University of Oxford, Manor Rd, OxfordOX1 3UJ, UK E-mail: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

In this paper, we develop a new method for evaluating the reliability polynomial of a hammock network. The method is based on a homogeneous absorbing Markov chain and provides the exact reliability for networks of width less than 5 and arbitrary length. Moreover, it produces a lower bound for the reliability polynomial for networks of width greater than or equal to 5. To investigate how sharp this lower bound is, we compare our method with other approximation methods and it proves to be the most accurate in terms of absolute as well as relative error. Using the fundamental matrix, we also calculate the average time to absorption, which provides the mean length of a network that is expected to work.

Keywords

graph polynomialshammock networksMarkov chainsnetwork reliability
Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 36 , Issue 2 , April 2022 , pp. 276 - 293
Copyright
Copyright © The Author(s), 2020. Published by Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J.C., Barends, R., Boixo, S., Brandao, F.G.S.L., Buell, D.A., Burkett, B., Chen, Y., Chen, Z., Collins, R., Courtney, W., Dunsworth, A., Farhi, E., Foxen, B., Fowler, A., Gidney, C., Giustina, M., Graff, R., Guerin, K., Habegger, S., Harrigan, M.P., Hartmann, M.J., Ho, A., Hoffmann, M., Huang, T., Isakov, S.V., Jeffrey, E., Jiang, Z., Kafri, D., Kechedzhi, K., Kelly, J., Klimov, P.V., Knysh, S., Korotkov, A., Kostritsa, F., Landhuis, D., Lindmark, M., Lucero, E., McClean, J.R., Megrant, A., Mi, X., Mohseni, M., Mutus, J., Naaman, O., Neeley, M., Neill, C., Niu, M.Y., Ostby, E., Petukhov, A., Platt, J.C., Quintana, C., Roushan, P., Rubin, N.C., Sank, D., Satzinger, K.J., Smelyanskiy, V., Sung, K.J., Trevithick, M.D., Vainsencher, A., Villalonga, B., White, T., Yao, Z.J., Yeh, P., Zalcman, A., Neven, H., & Martinis, J.M. (2019). Quantum supremacy using a programmable superconducting processor. Nature 574: 505–510.CrossRefGoogle ScholarPubMed
Barlow, R.E. & Proschan, F. (1996). Mathematical theory of reliability. Philadelphia, USA: SIAM.CrossRefGoogle Scholar
Beiu, V., Dăuş, L, Rohatinovici, N.C, & Bălaş, V.E. (2017). Transport reliability on axonal cytoskeleton. In Proceedings of the 14th IEEE International Conference on Engineering of Modern Electric Systems(EMES’17). IEEE, pp. 160–163.CrossRefGoogle Scholar
Bell, M.G.H. & Iida, Y. (1997). Transportation network analysis. Chichester, UK: John Wiley & Sons.CrossRefGoogle Scholar
Boixo, S., Isakov, S.V., Smelyanskiy, V.N., Babbush, R., Ding, N., Jiang, Z., Bremner, M.J., Martinis, J.M., & Neven, H. (2018). Characterizing quantum supremacy in near-term devices. Nature Physics 14(6): 595–600.CrossRefGoogle Scholar
Brown, J.I., Colbourn, C.J., Cox, D., Graves, C., & Mol, L. (2020). Network reliability: Heading out on the highway. Networks 1–15. https://doi.org/10.1002/net.21977.CrossRefGoogle Scholar
Chakraborty, S., Goyala, N.K., Mahapatra, S., & Soh, S. (2020). A Monte-Carlo Markov chain approach for coverage-area reliability of mobile wireless sensor networks with multistate nodes. Reliability Engineering & System Safety 193: 106662.Google Scholar
Chang, L. & Wu, Z. (2011). Performance and reliability of electrical power grids under cascading failures. International Journal of Electrical Power & Energy Systems 33(8): 1410–1419.CrossRefGoogle Scholar
Chao, M.T. & Fu, J.C. (1989). A limit theorem of certain repairable systems. Annals of the Institute of Statistical Mathematics 41(4): 809–818.CrossRefGoogle Scholar
Chao, M.T. & Fu, J.C. (1991). The reliability of a large series system under Markov structure. Advances in Applied Probability 23(4): 894–908.CrossRefGoogle Scholar
Colbourn, C.J. (1987). The combinatorics of network reliability. Oxford, UK: Oxford University Press.Google Scholar
Cowell, S.R., Beiu, V., Dăuş, L., & Poullin, P. (2017). On cylindrical hammock networks. In Proceedings of the 17th IEEE International Conference on Nanotechnology. IEEE, pp. 185–188.CrossRefGoogle Scholar
Cowell, S.R., Beiu, V., Dăuş, L., & Poulin, P. (2018). On the exact reliability enhancements of small hammock networks. IEEE Access 6: 25411–25426.CrossRefGoogle Scholar
Cowell, S.R., Hoară, S., & Beiu, V. (2020). Experimenting with beta distributions for approximating hammocks’ reliability. In Intelligent Methods in Computing, Communications and Control. ICCCC 2020, vol. 1243 of Advances in Intelligent Systems and Computing. Springer, pp. 70–81.Google Scholar
Dăuş, L. & Jianu, M. (2020). The shape of the reliability polynomial of a hammock network. In Intelligent Methods in Computing, Communications and Control. ICCCC 2020, vol. 1243 of Advances in Intelligent Systems and Computing. Springer, pp. 93–105.Google Scholar
Dăuş, L. & Jianu, M. (2020). Full Hermite interpolation of the reliability of a hammock network. Applicable Analysis and Discrete Mathematics 14(1): 198–220.CrossRefGoogle Scholar
Drăgoi, V., Cowell, S.R., Beiu, V., Hoară, S., & Gaşpar, P. (2018). How reliable are compositions of series and parallel networks compared with hammocks? International Journal of Computers, Communications and Control 13(5): 772–791.CrossRefGoogle Scholar
Fu, J.C. (1986). Reliability of consecutive-k-out-of-n:F system with (k − 1)-step Markov dependence. IEEE Transactions on Reliability R-35(5): 602–605.CrossRefGoogle Scholar
Fu, J.C. & Hu, B. (1987). On reliability of a large consecutive-k-out-of-n:F system with (k − 1)-step Markov dependence. IEEE Transactions on Reliability R-36(1): 75–77.Google Scholar
Fu, X., Fortino, G., Li, W., Pace, P., & Yang, Y. (2019). WSNs-assisted opportunistic network for low-latency message forwarding in sparse settings. Future Generation Computer Systems 91: 223–237.CrossRefGoogle Scholar
Fu, X., Fortino, G., Pace, P., Aloi, G., & Li, W. (2020). Environment-fusion multipath routing protocol for wireless sensor networks. Information Fusion 53: 4–19.CrossRefGoogle Scholar
Gong, M., Xie, M., & Yang, Y. (2018). Reliability assessment of system under a generalized run shock model. Journal of Applied Probability 55(4): 1249–1260.Google Scholar
Gong, M., Eryilmaz, S., & Xie, M. (2020). Reliability assessment of system under a generalized cummulative run shock model. Proceedings of the Institution of Mechanical Engineers Part O: Journal of Risk and Reliability 234(1): 129–137.Google Scholar
Grinstead, C.M. & Snell, J.L. (1997). Introduction to probability. USA: American Mathematical Society.Google Scholar
Iosifescu, M. (1980). Finite Markov processes and their applications. Chichester, UK: John Wiley & Sons.Google Scholar
Kemeny, J.G. & Snell, J.L. (1976). Finite Markov chains. New York, USA: Springer-Verlag.Google Scholar
Kim, H. & O'Kelly, M.E. (2009). Reliable p-hub location problems in telecommunication networks. Geographical Analysis 41(3): 283–306.CrossRefGoogle Scholar
Koutras, M.V. (1996). On a Markov chain approach for the study of reliability structures. Journal of Applied Probability 33(2): 357–367.CrossRefGoogle Scholar
Li, Y., Zhang, Y., Qiu, L., & Lam, S. (2007). Smarttunnel: Achieving reliability in the Internet. In Proceedings of the 26th IEEE INFOCOM. IEEE, pp. 830–838.CrossRefGoogle Scholar
Liu, J., Peng, Q., Chen, J., & Yin, Y. (2020). Connectivity reliability on an urban rail transit network from the perspective of passenger travel. Urban Rail Transit 6(1): 1–14.CrossRefGoogle Scholar
Moore, E.F. & Shannon, C.E. (1956). Reliable circuits using less reliable relays, Part I. Journal of Franklin Institute 262(3): 191–208.CrossRefGoogle Scholar
Moore, E.F. & Shannon, C.E. (1956). Reliable circuits using less reliable relays, Part II. Journal of Franklin Institute 262(4): 281–297.CrossRefGoogle Scholar
Nath, M., Ren, Y., Khorramzadeh, Y., & Eubank, S. (2018). Determining whether a class of random graphs is consistent with an observed contact network. Journal of Theoretical Biology 440: 121–132.CrossRefGoogle ScholarPubMed
Nath, M., Ren, Y., & Eubank, S. (2019). An approach to structural analysis using Moore-Shannon network reliability. Complex Networks and Their Applications VII. Studies in Computational Intelligence 812: 537–549.Google ScholarPubMed
Ross, S.M. (2010). Introduction to probability models, 10th ed. Oxford, UK: Elsevier (Academic Press).Google Scholar
Valiant, L. (1979). The complexity of enumeration and reliability problems. SIAM Journal on Computing 8(3): 410–421.CrossRefGoogle Scholar
Villalonga, B., Boixo, S., Nelson, B., Henze, C., Rieffel, E., Biswas, R., & Mandra, S. (2019). A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware. npj Quantum Information 5(1): 1–16.CrossRefGoogle Scholar
von Neumann, J. (1956). Probabilistic logics and the synthesis of reliable organisms from unreliable components. In Automata Studies, vol. 34 of Annals of Mathematics Studies. Princeton University Press, pp. 43–98.CrossRefGoogle Scholar
Youssef, M., Khorramzadeh, Y., & Eubank, S. (2013). Network reliability: The effect of local network structure on diffusive processes. Physical Review E 88(5): 052810.CrossRefGoogle ScholarPubMed
Zhu, X., Boushaba, M., Coit, D.W., & Benyahia, A. (2017). Reliability and importance measures for m-consecutive-k, l-out-of-n system with non-homogeneous Markov-dependent components. Reliability Engineering & System Safety 167: 1–9.CrossRefGoogle Scholar