Skip to main content
SpringerLink
Log in

Optimally reliable networks

  • Section II Network Reliability
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

In this paper, we consider the probability of disconnection of a graph as a measure of network reliability. We compare the vertex and edge failure cases, and then concentrate on the vertex failure case. Optimal graphs are graphs which minimise the probability of disconnection for a given number of vertices and edges when the probability of vertex failure is small. We describe the known results on the construction of optimal regular graphs and present some new results on the construction of optimal nonregular graphs.

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. D. Bauer, F. Boesch, C. Suffel and R. Tindell, Connectivity extremal problems and the design of reliable probabilistic networks, in:The Theory and Application of Graphs, ed. G. Chartrand, Y. Alavi, D. Goldsmith, L. Lesniak-Foster and D. Lick (Wiley, 1981), pp. 45–54.

  2. F.T. Boesch, Synthesis of reliable networks — a survey, IEEE Trans. Reliability R-35(1986) 240–246.

    Google Scholar 

  3. F.T. Boesch, On unreliability polynomials and graph connectivity in reliable network synthesis, J. Graph Theory 10(1986)339–352.

    Google Scholar 

  4. F.T. Boesch and A.P. Felzer, On the invulnerability of the regular completek-partite graphs, SIAM J. Appl. Math. 20(1971)176–182.

    Google Scholar 

  5. H. Frank, SOme new results in the design of survivable networks,Proc. 12th Ann. Midwest Circuit Theory Symp., University of Texas (1969), pp. 13.1–13.8.

  6. H. Frank, Maximally reliable node weighted graphs,Proc. 3rd Ann. Conf. on Information Sciences and Systems, Princeton University (1969), pp. 1–6.

  7. H. Frank and I. Frisch,Communication, Transmission and Transportation Networks (Addison-Wesley, 1971).

  8. S.L. Hakimi and A.T. Amin, On the design of reliable networks, Networks 3(1973)241–260.

    Google Scholar 

  9. F. Harary, The maximum connectivity of a graph, Proc. Nat. Acad. Sci. USA 48(1962)1142–1146.

    Google Scholar 

  10. D.H. Smith, Graphs with the smallest number of minimum cut sets, Networks 14(1984)47–61.

    Google Scholar 

  11. D.H. Smith and L.L. Doty, On the construction of optimally reliable graphs, Networks 20(1990)723–729.

    Google Scholar 

  12. D.H. Smith, Reliable networks and (k, 2k − 2)-connected graphs,Proc. 9th British Combinatorial Conf. 16B(1983)171–176.

    Google Scholar 

  13. R.S. Wilcov, Analysis and design of reliable computer networks, IEEE Trans. Commun. COM-20(1972)660–678.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computing, The Polytechnic of Wales, CF37 1DL, Pontypridd, Mid-Glamorgan, Wales, UK

    D. H. Smith

Authors
  1. D. H. Smith
    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

Smith, D.H. Optimally reliable networks. Ann Oper Res 33, 107–112 (1991). https://doi.org/10.1007/BF02073595

Download citation

  • Issue Date:

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

Keywords

Search

Navigation