{"title":"Аnalysis and synthesis of communication network structures by state enumeration method","authors":"K. Batenkov","doi":"10.21638/11701/spbu10.2022.301","DOIUrl":null,"url":null,"abstract":"Оne of the methods of analysis and synthesis of communication network structures is considered, based on the simplest approach to calculating the probability of connectivity - the method of iterating over the states of the network edges. Despite its significant drawback, which consists in the considerable complexity of the calculations carried out, it turns out to be quite in demand both at the stage of debugging new analysis methods and when performing the procedure of sequential synthesis of network structures. The proposed method of sequential synthesis can be presented in the form of stages, at each of which one or more edges (network elements) are added. An increase in the number of edges used leads to an increase in the number of variations of the connectivity functions of a graph with an added edge, and hence to an increase in the complexity of operations for calculating conditional probabilities. At the same time, such a complication makes it possible to more accurately solve the synthesis problem, since not in all situations the sequential addition of edges is equivalent to sorting through all possible alternatives. Both the described method of analyzing the structures of communication networks based on the enumeration of states and the synthesis method differ in the essential simplicity of the implementation of the processes of the calculations carried out. It is this circumstance that allows us to use these methods as reference. The accuracy of the calculations depends solely on the capabilities of hardware and software systems and is in no way limited directly by the method of sorting states. As a result, the calculation of the probability of connectivity with precision accuracy, which is typical for situations of comparative analysis of communication networks with the availability and survivability coefficients of individual network elements close to the threshold values, also turns out to be feasible on the basis of the methods considered.","PeriodicalId":43738,"journal":{"name":"Vestnik Sankt-Peterburgskogo Universiteta Seriya 10 Prikladnaya Matematika Informatika Protsessy Upravleniya","volume":"41 1","pages":""},"PeriodicalIF":0.3000,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Vestnik Sankt-Peterburgskogo Universiteta Seriya 10 Prikladnaya Matematika Informatika Protsessy Upravleniya","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.21638/11701/spbu10.2022.301","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0
Abstract
Оne of the methods of analysis and synthesis of communication network structures is considered, based on the simplest approach to calculating the probability of connectivity - the method of iterating over the states of the network edges. Despite its significant drawback, which consists in the considerable complexity of the calculations carried out, it turns out to be quite in demand both at the stage of debugging new analysis methods and when performing the procedure of sequential synthesis of network structures. The proposed method of sequential synthesis can be presented in the form of stages, at each of which one or more edges (network elements) are added. An increase in the number of edges used leads to an increase in the number of variations of the connectivity functions of a graph with an added edge, and hence to an increase in the complexity of operations for calculating conditional probabilities. At the same time, such a complication makes it possible to more accurately solve the synthesis problem, since not in all situations the sequential addition of edges is equivalent to sorting through all possible alternatives. Both the described method of analyzing the structures of communication networks based on the enumeration of states and the synthesis method differ in the essential simplicity of the implementation of the processes of the calculations carried out. It is this circumstance that allows us to use these methods as reference. The accuracy of the calculations depends solely on the capabilities of hardware and software systems and is in no way limited directly by the method of sorting states. As a result, the calculation of the probability of connectivity with precision accuracy, which is typical for situations of comparative analysis of communication networks with the availability and survivability coefficients of individual network elements close to the threshold values, also turns out to be feasible on the basis of the methods considered.
期刊介绍:
The journal is the prime outlet for the findings of scientists from the Faculty of applied mathematics and control processes of St. Petersburg State University. It publishes original contributions in all areas of applied mathematics, computer science and control. Vestnik St. Petersburg University: Applied Mathematics. Computer Science. Control Processes features articles that cover the major areas of applied mathematics, computer science and control.