Skip to main content
Springer Nature Link
Log in

Using Metrics in the Analysis and Synthesis of Reliable Graphs

  • Conference paper
  • First Online:
Biologically Inspired Cognitive Architectures 2019 (BICA 2019)

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

Included in the following conference series:

  • 887 Accesses

Abstract

The interaction of intelligent agents implies the existence of an environment to support it. The usual representations of this environment are graphs with certain properties. Reliability is one of the most important characteristics of such graphs. Traditional metrics, i.e. the usual shortest paths and minimal cuts, form the basis of the traditional measures of reliability. The analyzing and synthesizing of reliable graphs using the Euclidian metric are described. The Euclidian metric allows us to achieve better results in doing this compared to the cases of using traditional metrics. The described approach can be used in the analysis and synthesis of the environment supporting the intercommunication of intelligent agents in conditions of limited resources to organize the structure of this interaction.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Samoylenko SI, Davydov AA, Zolotarev VV, Tret’yakova EI (1981) Computer networks. Nauka, Moskow, 277p

    Google Scholar 

  2. Ball MO (1980) Complexity of network reliability computations. Networks 10(2):153–165

    Article  MathSciNet  Google Scholar 

  3. Moore EF, Shannon CE (1956) Reliable circuits using less reliable relays. J Franklin Inst 262:191–208

    Article  MathSciNet  Google Scholar 

  4. Rusakov VA (1979) Analysis and synthesis of computer network structures. Part 1 Analysis Moscow Engg Phys Inst. Report, VNTI Centre No Б796153, 122p

    Google Scholar 

  5. Rusakov VA (2018) Matrices, shortest paths, minimal cuts and Euclidian metric for undirected graphs. Procedia Comput Sci 145:444–447. https://doi.org/10.1016/j.procs.2018.11.104

    Article  Google Scholar 

  6. Polya G (1962, 1965, 1981) Mathematical discovery. Wiley, New York, 221p

    Google Scholar 

  7. Kemeny J, Snell J (1960) Finite Markov chains. University series in undergraduate mathematics. Van Nostrand, Princeton NJ, 210p

    Google Scholar 

  8. Albert AE (1972) Regression and the Moore-Penrose pseudoinverse. Academic Press, New York, 180p

    Google Scholar 

  9. Beklemishev DV (1983) Additional chapters of linear algebra. Nauka, Moscow, 336p

    Google Scholar 

  10. Gerla M, Kleinrock L (1977) On the topological design of distributed computer networks. IEEE Trans Commun 25(1):48–60

    Article  MathSciNet  Google Scholar 

  11. Withney H (1932) Congruent graphs and the connectivity of graphs. Amer J Math 54:150–168

    Article  MathSciNet  Google Scholar 

  12. Rusakov VA (1978) Implementation of the methodology for analysis and synthesis of computer network structures using Markov chains. Engg-Math Methods Phys Cybern (7):41–45. Atomizdat, Moscow

    Google Scholar 

  13. Rusakov VA (2011) Reconstruction of the Euclidian metric of an undirected graph by metrics of components. Nat Tech Sci 2(52):22–24. Sputnik+, Moscow

    Google Scholar 

  14. Wilkov RS (1972) Analysis and design of reliable computer networks. IEEE Trans Commun 20(3):660–678

    Article  Google Scholar 

  15. Wilkov RS (1972) Design of computer networks based on a new reliability measure. In: Proceedings of the symposium on computer communications networks and teletraffic. Polytech. Inst. of Brooklyn, 4–6 April, pp 371–384

    Google Scholar 

  16. Boesch FT, Thomas RE (1970) On graphs of invulnerable communication networks. IEEE Trans Commun Tech 18:484–489

    Article  Google Scholar 

  17. Hansler E (1972) A Fast Recursive Algorithm to Calculate the Reliability of a Communication Network. IEEE Trans Commun 20(3):637–640

    Article  Google Scholar 

  18. Rusakov VA (1977) A technique for analyzing and synthesizing the structures of computer networks using Markov chains. Computer networks and data transmission systems, 62–68. Znaniye, Moscow

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. National Research Nuclear University MEPhI (Moscow Engineering Physics Institute), 31 Kashirskoe shosse, 115409, Moscow, Russia

    Victor A. Rusakov

Authors
  1. Victor A. Rusakov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Victor A. Rusakov .

Editor information

Editors and Affiliations

  1. Moscow Engineering Physics Institute (MEPhI), Department of Cybernetics, National Research Nuclear University (NRNU), Moscow, Russia

    Alexei V. Samsonovich

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Rusakov, V.A. (2020). Using Metrics in the Analysis and Synthesis of Reliable Graphs. In: Samsonovich, A. (eds) Biologically Inspired Cognitive Architectures 2019. BICA 2019. Advances in Intelligent Systems and Computing, vol 948. Springer, Cham. https://doi.org/10.1007/978-3-030-25719-4_58

Download citation

Publish with us

Policies and ethics