An approach for obtaining estimation of stability of large communication network taking into account its dependent paths

Abstract

The physical data layer transmits bits over physical communication channels, such as coaxial cable or twisted pair. That is, it is this level that directly transmits data. At this level, the characteristics of electrical signals that transmit discrete information are determined. After that it is necessary to consider the control of the communication network, its various algorithms. When designing a communication network, a prerequisite is to calculate its stability, and in the case of large scale communication networks, this is a big problem. The most common deterministic, as well as fairly fast approximate method, which is often implemented at the present time, is the method by which the stability of the communication direction which is estimated by analyzing independent paths only. The main disadvantage of this method is obtaining an understated estimate of stability due to unaccountable dependent routes of communication directions. And this leads to inefficient use of resources. Our proposed methodology allows to take into not only independent paths, but also dependent ones, which is the basis for obtaining a significantly more correct estimate. It is based on an algorithm for checking the presence of a certain path and, based on it, an algorithm for obtaining an exact assessment of stability. The paper also provides analytical and statistical analysis of the considered algorithms. In particular, a special parameter was introduced that characterizes the probability of a failure event of communication lines, in which the number of failed communication lines lies in a certain specified range; after which a study of the function describing this parameter was carried out.

Routing algorithms in internet of things complex network with the role of machine learning

“…In detail, IoT devices in medical care, surgery, and driverless vehicles require high-precision, faster, reliable, and error-free algorithms (Dhumane et al, 2016b). Due to the fact that selection of efficient routes is one of the most important steps in networks, usually in networks most of the independent routes are considered, while there are many dependent routes that can be more efficient than the main routes, when the network load increases (Melnikov and Terentyeva, 2022). Choosing the suitable routing method helps economically by reducing maintenance costs, development costs or even deployment periods.…”

Greedy and branches-and-boundaries methods for the optimal choice of a subset of vertices in a large communication network

“…At the beginning of the paper, we repeat some sentences from the recent paper [Melnikov and Terentyeva, 2022] about the existing connection of the tasks we are considering with physical data layer transmits bits over physical communication channels. This connection of those problems that can be called related to physics with the problems of the theory of communication networks is also fully traced in this paper.…”

“…In this way, a completely different problem than in [Melnikov and Terentyeva, 2022] is considered, moreover, it is little related to it, if viewed from the point of view of the problems that arise for them in graph theory. However, these two problems are very closely related in terms of their practical application, and we have already briefly said about this.…”