Technique for estimating the connectivity probability of data system based on the search for minimum sections of graphs

DOI: 10.31673/2412-4338.2019.044656

Abstract

The article is dedicated to the construction of functionally stable system of data transmission. Taking into account the hierarchical structure of the system of data transfer, the study was conducted with the help of a graph model and the issues of optimally connected structures were addressed. The mathematical model of functionally stable system of data transmission is a non-oriented graph with reliable vertices and non-reliable edges. It was shown that with the given number of vertices and edges, different feasibilities of edge existence can correspond to different optimal structures of the graph. In order to analyze the functional stability of the system of data transmission the feasibility indicator, calculated in accordance with the characteristics of a set of minimal incisions of the graph model, is proposed. There is an effective algorithm of solving the task of optimization of net topology on the stage of projecting with given indicator, which defines the set of minimal incisions of the graph model and the values of their characteristics. Also it was shown that for the rough estimate of functional stability of the system of data transmission with the slight loss of accuracy it is enough to define the complete population of minimal incisions of the graph model of the system in correspondence with their characteristics. Given algorithm allows to estimate functional stability of the obtained system quite expeditiously.

Keywords: functional stability; data transmission system; minimal section of the graph.

References
1. Dodonov A.G., Lundy D.V. (2011), “The survivability of information systems”, Sciences Opinion: 256. Print
2. Baranov, G.L., Makarov A.V. (1986), “Structural modeling of complex dynamical systems” Scientific Thought: 272. Print
3. Barabash O.V. (2004), “Building functionally stable distributed information systems” K., NAOU: 226. Print
4. William Stallings, (2011), “Operating Systems – Internals and Design Principles”, 7th Edition. Prentice Hall, ISBN 013230998X: 816. Print 5. Shubinsky I.B. (2012) “Structural reliability of information systems. Methods of analysis.” Ulyanovsk: Regional Printing House Print Yard: 216.
6. Mozhaeva I.A., Nozik A.A., Strukov A.V. “Current trends in structural and logical analysis of the reliability and cybersecurity of ACMS”, http://www.szma.com/mabr2_2015.pdf.
7. Stollings V. “Data Transfer” 4th ed. (2004), St. Petersburg: Peter: 750. Print
8. Zaichenko Yu.P, Gonta Yu.V. (1986), “Structural optimization of computer networks” K., Engineering: 167. Print.
9. Stoer M., Wagner F. (1997), “A simple min-cut algorithm”, Jornal of the ACM., Vol. 44, No. 4: 585-591. Print.
11. Knyazev N.A. (2012), “Algorithms for estimating the structural survivability of the infocommunication network”, Modern information and communication technologies. Eighth Science - Tech. conf .: collection of abstracts., K:192-193. Print.
12. Korolev A.V., Kuchuk G.A., Pashnev A.A. (2003), “Adaptive routing in corporate networks” Kh., KhVU: 224. Print.
13. Olifer VG, (1999) ,“Computer Networks. Principles of technology, protocols” S.-Pb., Peter: 668. Print
14. Maksimenko A.N. (2004), “Polygraphs graphs and reducibility of combinatorial optimization problems” Yaroslavl: YSU: 92. Print.
15. Trofimchuk A.N., Vasianin V.A (2016), “Computer simulation of a hierarchical structure of a switching network with discrete multiproduct flows “, USiM. 2: 48-57. Print.