Skip to main content
SpringerLink
Log in

An Approach to Calculating the Probability of Retaining the Maximal Flow

  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

Consideration is given to the probabilistic ow network whose arcs fail independently with the given probabilities. By the probability of retaining the maximal ow is meant the probability that the maximal ow in such a network is equal to the maximal ow in the corresponding nonprobabilistic network. A method of its precise and approximate (with given error) calculation is proposed, and examples are presented.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

REFERENCES

  1. Ball, M.O., Colbourn, C.J., and Provan, J.S., Network Reliability, in Handbooks in OR&MS, Amsterdam: Elsevier, 1995, ch. 11, vol. 7, pp. 673–762.

    Google Scholar 

  2. Frank, H. and Frisch, I.T., Probabilistic Flow Through a Communication Network, IEEE Trans.Circuit Theory, 1971, vol. CT-12, pp. 413–414.

    Google Scholar 

  3. Gary, M. and Johnson, D., Computers and Intractability, New York: Wiley, 1978. Translated under the title Vychislitel'nye machiny i trudnoreshaemye zadachi, Moscow: Mir, 1982.

    Google Scholar 

  4. Ford, L.R., Jr. and Fulkerson, D.R., Flows in Networks, Princeton: Princeton Univ. Press, 1962. Translated under the title Potoki v setyakh, Moscow: Mir, 1966.

    Google Scholar 

  5. Filin, B.P., Metody analiza strukturnoi nadezhnosti setei svyazi (Methods of Analysis of the Structural Reliability of Communication Networks), Moscow: Radio i Svyaz', 1988.

    Google Scholar 

  6. Adel'son-Vel'skii, G.M., Dinits, E.A., and Karzanov, A.V., Potokovye algoritmy (Flow Algorithms), Moscow: Nauka, 1975.

    Google Scholar 

  7. Ershov, V.A., Netes, V.A., and Filin, B.P., Calculating the Probability of Providing the Required Throughput of the Bipolar Network of Nonreliable Elements, Avtom.Telemekh., 1996, no. 3, pp. 161–184.

  8. Filin, B.P., On the Principle of Duality in Analysis of Structural Reliability of Complex Systems, Avtom.Telemekh., 1989, no. 6, pp. 158–172.

  9. Edmonds, J. and Fulkerson, D.R., Bottleneck Extrema, J.Combinatorial Theory, 1970, vol. 8, pp. 299–306.

    Google Scholar 

  10. Butrimenko, A.V., On Finding the Shortest Paths on the Graph upon Its Changes, Izv.Akad.Nauk SSSR, Tekh.Kibern., 1964, no. 6, pp. 55–58.

  11. Filin, B.P., On the Method of Fast Estimation of Reliability and the Coefficient of Potential Structural Invulnerability of the Links in a Complex Systems, Avtom.Telemekh., 1994, no. 5, pp. 158–182.

Download references

Author information

Authors and Affiliations

  1. Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia

    B. P. Filin

  2. Rostelekom Co., Moscow, Russia

    A. V. Shaparev

Authors
  1. B. P. Filin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. V. Shaparev
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Filin, B.P., Shaparev, A.V. An Approach to Calculating the Probability of Retaining the Maximal Flow. Automation and Remote Control 62, 86–100 (2001). https://doi.org/10.1023/A:1002884002060

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1002884002060

Keywords

Search

Navigation