Trudy SPIIRAN
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Informatics and Automation:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Trudy SPIIRAN, 2018, Issue 58, Pages 128–159
DOI: https://doi.org/10.15622/sp.58.6
(Mi trspy1009)
 

This article is cited in 5 scientific papers (total in 5 papers)

Digital Information Telecommunication Technologies

Analysis and synthesis of communication network structures according to the determined stability indicators

K. A. Batenkova, A. A. Batenkovb

a The Academy of Federal Security Guard Service of the Russian Federation
b Orel branch of The Institute of Informatics Problems of the Russian Academy of Sciences (IPI RAN)
Abstract: When solving problems related to the analysis and synthesis of communication networks for stability, a special place is simple and easy to understand indicators, weakly linked to the classical concept of exit probability from a state of health. Such deterministic indicators of stability (connectedness, a couple of connections, linear functional connectivity, the number of spanning trees) allow, albeit very approximately, to solve a complex of tasks related to the assessment of the reliability and survivability complex networks. Due to the rather simple analytical form of a linear functional connectivity for the synthesis of structures, it is possible to use the analytical method presented in the work. In this general formulation for the synthesis of connected graphs is formulated as the maximization of the linear functional connectivity for all possible graphs with a given number of edges, vertices, and with fixed values of their weighting coefficients. In general, the deterministic indicators are characterized by a rather serious drawback, which is manifested in the inability to take into account the peculiarities of the functioning of individual communication lines. In addition, for structures of general type, where the expression of the linear functional is not reduced to an analytical form, the constructiveness of such an indicator of connectivity of structures of communication networks (graphs) is less pronounced. In theoretical studies on structures of general type, the linear functional is weakly correlated with already existing concepts (for example, with edge connectivity). Therefore, despite the fact that it, as an indication of connectivity (reliability), can be used to evaluate any structure, in the study of structures of general type, it is more rational to use such indicators of connectivity, which are still in any way consistent with the principles used in graph theory.
Keywords: network graph structure, a deterministic indicators of stability, connectivity, pair of connections, linear functional connectivity, the number of spanning trees.
Received: 14.11.2017
Bibliographic databases:
Document Type: Article
UDC: 519.718:004.722
Language: Russian
Citation: K. A. Batenkov, A. A. Batenkov, “Analysis and synthesis of communication network structures according to the determined stability indicators”, Tr. SPIIRAN, 58 (2018), 128–159
Citation in format AMSBIB
\Bibitem{BatBat18}
\by K.~A.~Batenkov, A.~A.~Batenkov
\paper Analysis and synthesis of communication network structures according to the determined stability indicators
\jour Tr. SPIIRAN
\yr 2018
\vol 58
\pages 128--159
\mathnet{http://mi.mathnet.ru/trspy1009}
\crossref{https://doi.org/10.15622/sp.58.6}
\elib{https://elibrary.ru/item.asp?id=35630306}
Linking options:
  • https://www.mathnet.ru/eng/trspy1009
  • https://www.mathnet.ru/eng/trspy/v58/p128
  • This publication is cited in the following 5 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Informatics and Automation
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024