Skip to main content
SpringerLink
Log in

On Calculation and Estimation of Flow Transmission Probability in a Communication Network

  • Conference paper
  • First Online:
Optimization Problems and Their Applications (OPTA 2018)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 871))

  • 532 Accesses

Abstract

We study the problem of estimating a probability that a flow of a given capacity may be transferred in a communication network. Network is represented by a random graph with absolutely reliable nodes and unreliable links with given operational probabilities and capacities. The algorithm for fast decision making whether a network is reliable enough for transmission of a given flow is proposed. Case studies show applicability of the proposed approach.

Supported by Russian Foundation for Basic Research under grants 17-07-00775, 18-07-00460.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Evans, J.R.: Maximum flow in probabilistic graphs-discrete case. Networks 6, 161–183 (1976)

    Article  MathSciNet  Google Scholar 

  2. Lin, Y.K.: MC-based algorithm for a telecommunication network under node and budget constraints. Appl. Math. Comput. 190, 1540–1550 (2007)

    MathSciNet  MATH  Google Scholar 

  3. Lin, Y.K.: Reliability of k separate minimal paths under both time and budget constraints. IEEE Trans. Reliab. 59(1), 183–190 (2010)

    Article  Google Scholar 

  4. Forghani-Elahabad, M., Mahdavi-Amiri, N.: An efficient algorithm for the multi-state two separate minimal paths reliability problem with budget constraint. Reliab. Eng. Syst. Saf. 142, 472–481 (2015)

    Article  Google Scholar 

  5. Todinov, M.T.: Topology optimization of repairable flow networks and reliability networks. Int. J. Simul. Syst. Sci. Technol. 11(3), 75–84 (2010)

    Google Scholar 

  6. Wu, W.W., Ning, A., Ning, X.X.: Evaluation of the reliability of transport networks based on the stochastic flow of moving objects. Reliab. Eng. Syst. Saf. 93, 838–844 (2008)

    Article  Google Scholar 

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

    Google Scholar 

  8. Won, J.-M., Karray, F.: Cumulative update of all-terminal reliability for faster feasibility decision. IEEE Trans. Reliab. 59(3), 551–562 (2010)

    Article  Google Scholar 

  9. Won, J.-M., Karray, F.: A greedy algorithm for faster feasibility evaluation of all-terminal-reliable networks. IEEE Trans. Syst. Man Cybern. Part B Cybern. 41(6), 1600–1611 (2011)

    Article  Google Scholar 

  10. Rodionov, A.S., Migov, D.A., Rodionova, O.K.: Improvements in the efficiency of cumulative updating of all-terminal network reliability. IEEE Trans. Reliab. 61(2), 460–465 (2012)

    Article  Google Scholar 

  11. Rodionov, A.S., Rodionova, O.K.: Exact bounds for average pairwise network reliability. In: the 7th ACM International Conference on Ubiquitous Information Management and Communication (Kota Kinabalu, Malaysia), Article no. 45. ACM New York (2013)

    Google Scholar 

  12. Migov, D.A., Nesterov, S.N.: Methods of speeding up of diameter constrained network reliability calculation. In: Gervasi, O., Murgante, B., Misra, S., Gavrilova, M.L., Rocha, A.M.A.C., Torre, C., Taniar, D., Apduhan, B.O. (eds.) ICCSA 2015. LNCS, vol. 9156, pp. 121–133. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-21407-8_9

    Chapter  Google Scholar 

  13. Migov, D.A., Nechunaeva, K.A., Nesterov, S.N., Rodionov, A.S.: Cumulative updating of network reliability with diameter constraint and network topology optimization. In: Gervasi, O., Murgante, B., Misra, S., Rocha, A.M.A.C., Torre, C., Taniar, D., Apduhan, B.O., Stankova, E., Wang, S. (eds.) ICCSA 2016. LNCS, vol. 9786, pp. 141–152. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-42085-1_11

    Chapter  Google Scholar 

  14. Rodionov, A.S.: Cumulative estimated values of structural networks reliability indices and their usage. In: IEEE Conference on Dynamics of Systems, Mechanisms and Machines (Omsk, Russia), pp. 1–4. IEEE Press, New York (2016)

    Google Scholar 

  15. Migov, D.A.: Evaluation of wireless sensor network reliability with use of reliability bounds cumulative updating. In: IEEE International Forum on Strategic Technology (Ulsan, Korea), pp. 120–124. IEEE Press, New York (2017)

    Google Scholar 

  16. Rodionov, A.S., Migov D.A.: Obtaining and using cumulative bounds of network reliability. In: Volosencu, C. (ed.) System Reliability, pp. 93–112. InTech, Rijeka, Croatia (2017). Chap. 5

    Google Scholar 

  17. Ball, M.O.: Computational complexity of network reliability analysis: an overview. IEEE Trans. Reliab. 35, 230–239 (1986)

    Article  Google Scholar 

  18. Canale, E., Cancela, H., Robledo, F., Romero, P., Sartor, P.: Full complexity analysis of the diameter-constrained reliability. Int. Trans. Oper. Res. 22(5), 811–821 (2015)

    Article  MathSciNet  Google Scholar 

  19. Page, L.B., Perry, J.E.: A practical implementation of the factoring theorem for network reliability. IEEE Trans. Reliab. 37(3), 259–267 (1998)

    Article  Google Scholar 

  20. Ford, L.R., Fulkerson, D.R.: Maximal flow through a network. Can. J. Math. 8, 399–404 (1956)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computational Mathematics and Mathematical Geophysics of SB RAS, prospekt Akademika Lavrentieva 6, 630090, Novosibirsk, Russia

    Alexey S. Rodionov, Olga A. Yadykina & Denis A. Migov

Authors
  1. Alexey S. Rodionov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Olga A. Yadykina
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Denis A. Migov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Denis A. Migov .

Editor information

Editors and Affiliations

  1. Sobolev Institute of Mathematics SB RAS, Omsk, Russia

    Anton Eremeev

  2. Krasovsky Institute of Mathematics and Mechanics, Ekaterinburg, Russia

    Michael Khachay

  3. Sobolev Institute of Mathematics SB RAS, Novosibirsk, Russia

    Yury Kochetov

  4. Industrial and Systems Engineering, University of Florida, Gainesville, Florida, USA

    Panos Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Rodionov, A.S., Yadykina, O.A., Migov, D.A. (2018). On Calculation and Estimation of Flow Transmission Probability in a Communication Network. In: Eremeev, A., Khachay, M., Kochetov, Y., Pardalos, P. (eds) Optimization Problems and Their Applications. OPTA 2018. Communications in Computer and Information Science, vol 871. Springer, Cham. https://doi.org/10.1007/978-3-319-93800-4_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-93800-4_26

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-93799-1

  • Online ISBN: 978-3-319-93800-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation