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
\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:
K. A. Batenkov, A. B. Fokin, “Analysis of the structural reliability of communication networks supporting protective switching mechanisms for one protected section and one backup section”, Rossijskij tehnologičeskij žurnal, 12:2 (2024), 39
A. A. Batenkov, K. A. Batenkov, A. B. Fokin, “Analiz veroyatnosti svyaznosti telekommunikatsionnoi seti na osnove matritsy nezavisimykh sobytii”, Avtomat. i telemekh., 2023, no. 11, 77–92
Alexander Denisov, Ekaterina Cherskikh, Lecture Notes in Electrical Engineering, 878, Communications, Signal Processing, and Systems, 2022, 18
Kirill Batenkov, CAD/EDA, MODELING AND SIMULATION IN MODERN ELECTRONICS: COLLECTION OF SCIENTIFIC PAPERS OF THE V INTERNATIONAL SCIENTIFIC AND PRACTICAL CONFERENCE, 2021, 81
Kirill Batenkov, CAD/EDA, MODELING AND SIMULATION IN MODERN ELECTRONICS: COLLECTION OF SCIENTIFIC PAPERS OF THE III INTERNATIONAL SCIENTIFIC AND PRACTICAL CONFERENCE, 2019, 153