Skip to main content
SpringerLink
Log in

A method for maximizing the reliability coefficient of a communications network

  • Combinatorial Optimization
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

The most common idea of network reliability in the literature is a numerical parameter calledoverall network reliability, which is the probability that the network will be in a successful state in which all nodes can mutually communicate. Most papers concentrate on the problem of calculating the overall network reliability which is known to be an NP hard problem. In the present paper, the question asked is how to find a method for determining a reliable subnetwork of a given network. Givenn terminals and one central computer, the problem is to construct a network that links each terminal to the central computer, subject to the following conditions: (1) each link must be economically feasible; (2) the minimum number of links should be used; and (3) the reliability coefficient should be maximized. We argue that the network satisfying condition (2) is a spanning arborescence of the network defined by condition (1). We define the idea of thereliability coefficient of a spanning arborescence of a network, which is the probability that a node at average distance from the root of the arborescence can communicate with the root. We show how this coefficient can be calculated exactly when there are no degree constraints on nodes of the spanning arborescence, or approximately when such degree constraints are present. Computational experience for networks consisting of up to 900 terminals is given.

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. J.A. Abraham, An improved algorithm for network reliability, IEEE Transactions on reliability R-28(1979)58.

    Google Scholar 

  2. K.K. Aggarwal, J.S. Gupta and K.B. Misra, A simple method for reliability evaluation of a communications system, IEEE Transactions on Communications COM-23(1975)563.

    Google Scholar 

  3. K.K. Aggarwal, K.B. Misra and J.S. Gupta, A fast algorithm for reliability evaluation, IEEE Transactions on Reliability R-24(1975)83.

    Google Scholar 

  4. K.K. Aggarwal, J.S. Gupta and K.B. Misra, A new heuristic criterion for solving a redundancy optimization problem, IEEE Transactions on Reliability R-24(1975)86.

    Google Scholar 

  5. K.K. Aggarwal and S. Rai, An efficient method for reliability evaluation of a general network, IEEE Transactions on Reliability R-27(1978)206.

    Google Scholar 

  6. K.K. Aggarwal and S. Rai, Reliability evaluation in a computer communications network, IEEE Transactions on Reliability R-30(1981)32.

    Google Scholar 

  7. K.K. Aggarwal, Y.C. Chopra and J.S. Bajwa, Capacity considerations in reliability analysis of communication systems, IEEE Transactions on Reliability R-31(1982)177.

    Google Scholar 

  8. A. Agrawal and R.E. Barlow, A survey of network reliability and domination theory, Oper. Res. 32, 3(1984)478.

    Google Scholar 

  9. A. Agrawal and A. Satyanarayna, An O(|E|) time algorithm for computing the reliability of a class of directed networks, Oper. Res. 32, 3(1984)493.

    Google Scholar 

  10. H.S. Ahmad, A simple technique for computing network reliability, IEEE Transactions on Reliability R-31(1982)41.

    Google Scholar 

  11. M.O. Ball, Computing network reliability, Oper. Res. 27(1979)823.

    Google Scholar 

  12. M.O. Ball, Complexity of network reliability computations, Networks 10(1980)153.

    Google Scholar 

  13. R. Billinton and K.E. Bollinger, Transmission system reliability evaluation using Markov process, IEEE Transactions on Power Apparatus and Systems PAS-87(1968)538.

    Google Scholar 

  14. J.A. Bondy and U.S.R. Murty,Graph Theory with Applications (North-Holland, Amsterdam, 1978).

    Google Scholar 

  15. J.A. Buzacott, Markov approach to finding failure time of repairable systems, IEEE Transaction on Reliability R-19(1970)128.

    Google Scholar 

  16. J.A. Buzacott, Network approaches to finding the reliability of repairable systems, IEEE Transactions on Reliability R-19(1970)140.

    Google Scholar 

  17. L. Fralta and U.G. Montanari, A recursive method based on case analysis for computing network terminal reliability, IEEE Transactions on Communications COM-26(1978)1166.

    Google Scholar 

  18. H. Frank and I.T. Frisch, Analysis and design of survivable networks, IEEE Transactions on Communications Technology COM-18(1970)501.

    Google Scholar 

  19. J.P. Gadani and K.B. Misra, A network reduction and transformation algorithm for assessing system effectiveness indexes, IEEE Transactions on Reliability R-30(1981)48.

    Google Scholar 

  20. M.R. Garey and D.S. Johnson,Computers and Intractability — A Guide to the Theory of NP-completeness (Freeman, San Francisco, 1979).

    Google Scholar 

  21. R.S. Garfinkel and G.L. Nemhauser,Integer Programming (Wiley, New York, 1972).

    Google Scholar 

  22. J.N. Hagstorm, Combinatoric Tools for Computing Network Reliability, Ph.D. Thesis, University of California, Berkeley (1980).

    Google Scholar 

  23. J.N. Hagstorm, Using the decomposition tree of a network in reliability computations, IEEE Transactions on Reliability R-32(1983)71.

    Google Scholar 

  24. J.N. Hagstorm, Combinatorial properties for directed network reliability with a path length criterion, Tech. Rep. 82-14, College of Business Administration, University of Illinois, and Box 4348, ChBox 4348, Ch. (1983).

  25. K. Inoue and E.J. Henley, Computer-aided reliability and safety analysis of complex systems, IFAC Sixth Triennial World Congress (August, 1975), part 1110.

  26. P. Jedrzejowicz, Allocation of resources to maximize quality measures of a system, IEEE Transactions on Reliability R-31, 1(1982).

    Google Scholar 

  27. P.A. Jensen and M. Bellmore, An algorithm to determine the reliability of a complex system, IEEE Transactions on Reliability R-18(1969)169.

    Google Scholar 

  28. T. Kohda and K. Inoue, A reliability optimization method for complex systems with the criterion of local optimality, IEEE Transactions on Reliability R-31, 1(1982)109.

    Google Scholar 

  29. W. Kuo, C.L. Hwang and F.A. Tillman, A note on heuristic methods in optimal system reliability, IEEE Transactions on Reliability R-27(1978)320.

    Google Scholar 

  30. K.K. Lee, A compilation technique for exact system reliability, IEEE Transactions on Reliability R-30(1981)284.

    Google Scholar 

  31. P.M. Lin, B.J. Leon and T.C. Huang, A new algorithm for symbolic system reliability analysis, IEEE Transactions on Reliability R-25(1976)2.

    Google Scholar 

  32. P.B. Mirchandani, Shortest distance and reliability of probabilistic networks, Computers and Operations Research 3(1976)347.

    Google Scholar 

  33. K.B. Misra and T.S.M. Rao, Reliability analysis of redundant network using flow graph, IEEE Transactions on Reliability R-19(1970)19.

    Google Scholar 

  34. J. Moreira de Souza and C. Landrault, Benefit analysis of concurrent redundancy techniques, IEEE Transactions on Reliability R-30(1981)67.

    Google Scholar 

  35. J.D. Murchland, Fundamental concepts and relations for reliability analysis of multi-state systems, in:Reliability and Fault Tree Analysis, ed. R.E. Barlow, J.B. Fussel and N.D. Singapurwalla (SIAM, Philadelphia, 1975) p. 581.

    Google Scholar 

  36. Y. Nakagawa and K. Nakashima, A heuristic method for determining optimal reliability allocation, IEEE Transactions on Reliability R-26(1977)156.

    Google Scholar 

  37. Y. Nakagawa and S. Miyazaki, An experimental comparison of the heuristic methods for solving system reliability optimization problems, IEEE Transactions on Reliability R-30 2(1981).

    Google Scholar 

  38. H. Nakazawa, Bayesian decomposition method for computing the reliability of an oriented network, IEEE Transactions on Reliability R-25(1976)77.

    Google Scholar 

  39. H. Nakazawa, Decomposition method for computing the reliability of complex networks, IEEE Transactions in Reliability R-30(1981)289.

    Google Scholar 

  40. A. Satyanarayna and A. Prabhakar, New topological formula and rapid algorithm for reliability analysis of complex networks, IEEE Transactions on Reliability R-27(1978)82.

    Google Scholar 

  41. A. Satyanarayna and J.N. Hagstorm, A new algorithm for the reliability analysis of multi-terminal networks, IEEE Transactions on Reliability R-30(1981)325.

    Google Scholar 

  42. A. Satyanarayna, A unified formula for analysis of some network reliability problems, IEEE Transactions on Reliability R-31, 1(1982)23.

    Google Scholar 

  43. G.L. Thompson and S. Singhal, A successful algorithm for solving directed Hamiltonian path problems, Oper. Res. Lett. 3, 1(1984)35.

    Google Scholar 

  44. G.L. Thompson and S. Singhal, A successful algorithm for the undirected Hamiltonian path problem, Working Paper 497, GSIA, Carnegie-Mellon University, Pittsburgh, PA (1984). Accepted for publication in Discrete Mathematics.

    Google Scholar 

  45. R.S. Wilkov, Analysis and design of reliable computer network, IEEE Transactions on Communications COM-20(1972)660.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Bell Laboratories, 07733, Holmdel, New Jersey, USA

    S. Singhal

  2. Graduate School of Industrial Administration, Carnegie-Mellon University, 15213, Pittsburgh, PA, USA

    G. L. Thompson

Authors
  1. S. Singhal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. L. Thompson
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This report was prepared as part of the activities of the Management Science Research Group, Carnegie-Mellon University, under Contract No. N00014-82-K-0329 NR 047–048 with the U.S. Office of Naval Research. Reproduction in whole or in part is permitted for any purpose of the U.S. Government.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Singhal, S., Thompson, G.L. A method for maximizing the reliability coefficient of a communications network. Ann Oper Res 4, 307–326 (1985). https://doi.org/10.1007/BF02022045

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02022045

Keywords and phrases

Search

Navigation