Skip to main content
SpringerLink
Log in

On Posets for Reliability: How Fine Can They Be?

  • Conference paper
  • First Online:
Soft Computing Applications (SOFA 2018)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 1221))

Included in the following conference series:

Abstract

This article investigates the structure of several posets over the set of reliability polynomials of minimal two-terminal networks. We expand on the work of Drăgoi et al. [14], which have focused on posets of compositions of networks. Our simulations show that other classes of two-terminal networks are amenable to this approach, including series-and-parallel networks and consecutive-k-out-of-n:F networks. We perform a finer analysis of the reliability polynomials associated with compositions of series-and-parallel. We also introduce here three different threshold points that define a new ordering on the set of reliability polynomials. This ordering is finer than the existing ones, and is total.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Ath, Y., Sobel, M.: Some conjectured uniformly optimal reliable networks. Prob. Eng. Inf. Sci. 14(3), 375–383 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  2. Ball, M.O., Colbourn, C.J., Provan, J.S.: Network reliability. In: Handbook of Operations Research: Network Models, Chap. 11, pp. 673–762. Elsevier, Amsterdam (1995)

    Google Scholar 

  3. Bardet, M., Chaulet, J., Drăgoi, V., Otmani, A., Tillich, J.P.: Cryptanalysis of the McEliece public key cryptosystem based on polar codes. In: Proceedings of International Workshop on Post-Quantum Cryptography (PQCrypto), Fukuoka, Japan, pp. 118–143 (2016)

    Google Scholar 

  4. Bardet, M., Drăgoi, V., Otmani, A., Tillich, J.P.: Algebraic properties of polar codes from a new polynomial formalism. In: Proceedings of IEEE International Symposium on Information Theory (ISIT), Barcelona, Spain, pp. 230–234 (2016)

    Google Scholar 

  5. Beiu, V., Dăuş, L.: Deciphering the reliability scheme of the neurons one ion channel at a time. In: Proceedings of International Conference on Bioinspired Information and Communications Technologies (BICT), Boston, MA, pp. 182–187 (2014)

    Google Scholar 

  6. Bertrand, H., Goff, O., Graves, C., Sun, M.: On uniformly most reliable two-terminal graphs. Networks 72(2), 200–216 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  7. Boesch, F.T., Li, X., Suffel, C.: On the existence of uniformly optimally reliable networks. Networks 21(2), 181–194 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  8. Brown, J.I., Cox, D.: Nonexistence of optimal graphs for all terminal reliability. Networks 63(2), 146–153 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  9. Brylawski, T.H.: A combinatorial model for series-parallel networks. Trans. Am. Math. Soc. 154, 1–22 (1971)

    Article  MathSciNet  MATH  Google Scholar 

  10. Carlitz, L., Riordan, J.: The number of labeled two-terminal series-parallel networks. Duke Math. J. 23(3), 435–445 (1956)

    Article  MathSciNet  MATH  Google Scholar 

  11. Colbourn, C.J.: The Combinatorics of Network Reliability. Oxford University Press, New York (1987)

    Google Scholar 

  12. Dăuş, L., Beiu, V.: Lower and upper reliability bounds for consecutive-\(k \)-out-of-\( n \):\({F}\) systems. IEEE Trans. Reliab. 64(3), 1128–1135 (2015)

    Google Scholar 

  13. Deng, H., Chen, J., Li, Q., Li, R., Gao, Q.: On the construction of most reliable networks. Discrete Appl. Math. 140(1–3), 19–33 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  14. Drăgoi, V., Cowell, S.R., Beiu, V.: Ordering series and parallel compositions. In: Proceedings of IEEE International Conference on Nanotechnology (IEEE-NANO), Cork, Ireland, pp. 1–4 (2018)

    Google Scholar 

  15. Drăgoi, V., Cowell, S.R., Beiu, V., Hoară, S., Gaşpar, P.: How reliable are compositions of series and parallel networks compared with hammocks? Int. J. Comput. Commun. Control 13(5), 772–791 (2018)

    Article  Google Scholar 

  16. Drăgoi, V., Cowell, S.R., Hoară, S., Gaşpar, P., Beiu, V.: Can series and parallel compositions improve on hammocks? In: Proceedings of International Conference on Computers Communications and Control (ICCCC), Oradea, Romania, pp. 124–130 (2018)

    Google Scholar 

  17. Duffin, R.J.: Topology of series-parallel networks. J. Math. Anal. Appl. 10(2), 303–318 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  18. Gordon, D.M., Miller, V.S., Ostapenko, P.: Optimal hash functions for approximate matches on the \(n\)-cube. IEEE Trans. Inf. Theory 56(3), 984–991 (2010)

    MathSciNet  MATH  Google Scholar 

  19. He, G., Belfiore, J., Land, I., Yang, G., Liu, X., Chen, Y., Li, R., Wang, J., Ge, Y., Zhang, R., Tong, W.: \(\beta \)-expansion: A theoretical framework for fast and recursive construction of polar codes. In: Proceedings of IEEE Global Communications Conference (GLOBECOM), Singapore, Singapore, art. 8254146, pp. 1–6 (2017)

    Google Scholar 

  20. Kontoleon, J.M.: Reliability determination of a \(r \)-successive-out-of-\( n \):\({f}\) system. IEEE Trans. Reliab. R–29(5), 437–437 (1980)

    MATH  Google Scholar 

  21. Lee, C.Y.: Analysis of switching networks. Bell Syst. Tech. J. 34(6), 1287–1315 (1955)

    Article  MathSciNet  Google Scholar 

  22. Lomnicki, Z.A.: Two-terminal series-parallel networks. Adv. Appl. Prob. 4(1), 109–150 (1972)

    Article  MathSciNet  MATH  Google Scholar 

  23. de Moivre, A.: The Doctrine of Chances, 1st ed., London (1718)

    Google Scholar 

  24. Mondelli, M., Hassani, S.H., Urbanke, R.: Construction of polar codes with sublinear complexity. In: Proceedings of IEEE International Symposium on Information Theory (ISIT), Aachen, Germany, pp. 1853–1857 (2017)

    Google Scholar 

  25. Moore, E.F., Shannon, C.E.: Reliable circuits using less reliable relays - Part I. J. Franklin Inst. 262(3), 191–208 (1956)

    Article  MathSciNet  MATH  Google Scholar 

  26. Moore, E.F., Shannon, C.E.: Reliable circuits using less reliable relays - Part II. J. Franklin Inst. 262(4), 281–297 (1956)

    Article  MATH  Google Scholar 

  27. Mori, R., Tanaka, T.: Performance and construction of polar codes on symmetric binary-input memoryless channels. In: Proceedings of IEEE International Symposium on Information Theory (ISIT), Seoul, South Korea, pp. 1496–1500 (2009)

    Google Scholar 

  28. Myrvold, W., Cheung, K.H., Page, L.B., Perry, J.E.: Uniformly-most reliable networks do not always exist. Networks 21(4), 417–419 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  29. Riordan, J., Shannon, C.E.: The number of two-terminal series-parallel networks. J. Math. Phys. 21(1–4), 83–93 (1942)

    Article  MathSciNet  Google Scholar 

  30. Schürch, C.: A partial order for the synthesized channels of a polar code. In: Proceedings of IEEE International Symposium on Information Theory (ISIT), Barcelona, Spain, pp. 220–224 (2016)

    Google Scholar 

  31. Stanley, R.P.: Enumerative Combinatorics. Cambridge University Press, Cambridge (2012)

    MATH  Google Scholar 

  32. Valiant, L.: The complexity of enumeration and reliability problems. SIAM J. Comput. 8(3), 410–421 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  33. von Neumann, J.: Probabilistic logics and the synthesis of reliable organisms from unreliable components. Automata Stud. 34, 43–98 (1956)

    MathSciNet  Google Scholar 

  34. Wang, G.: A proof of Boesch’s conjecture. Networks 24(5), 277–284 (1994)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Aknowledgement

Research supported by the EU through the European Research Development Fund under the Competitiveness Operational Program (BioCell-NanoART = Novel Bio-inspired Cellular Nano-architectures, POC-A1-A1.1.4-E-2015 nr. 30/01.09.2016).

Author information

Authors and Affiliations

  1. Faculty of Exact Sciences, “Aurel Vlaicu” University of Arad, Arad, Romania

    Valeriu Beiu, Simon R. Cowell & Vlad-Florin Drăgoi

  2. University of Rouen Normandy, LITIS, Mont-Saint-Aignan, France

    Vlad-Florin Drăgoi

Authors
  1. Valeriu Beiu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Simon R. Cowell
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Vlad-Florin Drăgoi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Vlad-Florin Drăgoi .

Editor information

Editors and Affiliations

  1. “Aurel Vlaicu” University of Arad, Faculty of Engineering, Arad, Romania

    Valentina Emilia Balas

  2. Faculty of Engineering and Information Technology, University of Technology Sydney, Centre for Artificial Intelligence, Sydney, Australia

    Lakhmi C. Jain

  3. Faculty of Engineering, “Aurel Vlaicu” University of Arad, Arad, Arad, Romania

    Marius Mircea Balas

  4. Department of Information Technology and Programming, Azerbaijan Technical University, Baku, Azerbaijan

    Shahnaz N. Shahbazova

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Beiu, V., Cowell, S.R., Drăgoi, VF. (2021). On Posets for Reliability: How Fine Can They Be?. In: Balas, V., Jain, L., Balas, M., Shahbazova, S. (eds) Soft Computing Applications. SOFA 2018. Advances in Intelligent Systems and Computing, vol 1221. Springer, Cham. https://doi.org/10.1007/978-3-030-51992-6_10

Download citation

Publish with us

Policies and ethics

Search

Navigation