{"title":"Methods for Formation of Telecommunication Network States Sets for Different Measures of Connectivity","authors":"A. Batenkov, K. Batenkov, A. Fokin","doi":"10.15622/sp.2020.19.3.7","DOIUrl":null,"url":null,"abstract":"Reliability, survivability, and stability analysis tasks are typical not only for telecommunications, but also for systems whose components are subject to one or more types of failures, such as transport, power, mechanical systems, integrated circuits, and even software. The logical approach involves the decomposition of the system into a number of small functional elements, and within telecommunications networks they are usually separate network devices (switches, routers, terminals, etc.), as well as communication lines between them (copper-core, fiber-optic, coaxial cables, wireless media, and other transmission media). Functional relationships also define logical relationships between the failures of individual elements and the failure of the network as a whole. The assumption is also used that device failures are relatively less likely than communication line failures, which implies using the assumption of absolute stability (reliability, survivability) of these devices. Model of a telecommunication network in the form of the generalized model of Erdos–Renyi is presented. In the context of the stability of the telecommunications network, the analyzed property is understood as the connectivity of the network in one form or another. Based on the concept of stochastic connectivity of a network, as the correspondence of a random graph of the connectivity property between a given set of vertices, three connectivity measures are traditionally distinguished: two-pole, multi-pole, and all-pole. The procedures for forming an arbitrary structure of sets of paths and trees for networks are presented, as well as their generalization of multipolar trees. It is noted that multipolar trees are the most common concept of relatively simple chains and spanning trees. Solving such problems will allow us to proceed to calculating the probability of connectivity of graphs for various connectivity measures.","PeriodicalId":53447,"journal":{"name":"SPIIRAS Proceedings","volume":"14 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"SPIIRAS Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15622/sp.2020.19.3.7","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 2
Abstract
Reliability, survivability, and stability analysis tasks are typical not only for telecommunications, but also for systems whose components are subject to one or more types of failures, such as transport, power, mechanical systems, integrated circuits, and even software. The logical approach involves the decomposition of the system into a number of small functional elements, and within telecommunications networks they are usually separate network devices (switches, routers, terminals, etc.), as well as communication lines between them (copper-core, fiber-optic, coaxial cables, wireless media, and other transmission media). Functional relationships also define logical relationships between the failures of individual elements and the failure of the network as a whole. The assumption is also used that device failures are relatively less likely than communication line failures, which implies using the assumption of absolute stability (reliability, survivability) of these devices. Model of a telecommunication network in the form of the generalized model of Erdos–Renyi is presented. In the context of the stability of the telecommunications network, the analyzed property is understood as the connectivity of the network in one form or another. Based on the concept of stochastic connectivity of a network, as the correspondence of a random graph of the connectivity property between a given set of vertices, three connectivity measures are traditionally distinguished: two-pole, multi-pole, and all-pole. The procedures for forming an arbitrary structure of sets of paths and trees for networks are presented, as well as their generalization of multipolar trees. It is noted that multipolar trees are the most common concept of relatively simple chains and spanning trees. Solving such problems will allow us to proceed to calculating the probability of connectivity of graphs for various connectivity measures.
期刊介绍:
The SPIIRAS Proceedings journal publishes scientific, scientific-educational, scientific-popular papers relating to computer science, automation, applied mathematics, interdisciplinary research, as well as information technology, the theoretical foundations of computer science (such as mathematical and related to other scientific disciplines), information security and information protection, decision making and artificial intelligence, mathematical modeling, informatization.