MANAGEMENT OF THE TRAINING SIMULATOR OF SPECIAL-PURPOSE ZONAL DATA NETWORKS

Author(s):  
М.А. БАСАРАБ ◽  
Р.А. БЕЛЬФЕР ◽  
А.В. КРАВЦОВ

Представлены процедуры выполнения одних из основных функций централизованного управления учебным имитатором сети передачи данных категории специального назначения: маршрутизации, информационной безопасности и управления неисправностями. Процедуры рассматриваются на примере конфигурации имитатора сети, представляющей собой часть сети передачи данных специального назначения страны (нижний уровень, зоновые сети). Показана возможность упростить решение задачи управления имитатором зоновой сети передачи данных категории специального назначения в сравнении с управлением сетями связи с помощью TMN и управлением виртуальной частной маршрутизируемой сетью ( VPRN) благодаря использованию принудительной маршрутизации («от источника»). Результаты работы планируется использовать для решения задачи управления имитатором сети, представляющей собой полную конфигурацию всей сети передачи данных страны, частью которой являются зоновые сети. The procedures for performing the main functions of centralized control of a training simulator of a special-purpose data transmission network (routing, information security, and fault management) are proposed. The procedures are discussed using an example of the configuration of a network simulator representing part of a country's special-purpose data network (lower level, zonal networks). It is shown that it is possible to simplify the solution of the complex task of managing a special-purpose data transmission network simulator in comparison with the management of communication networks using Telecommunication Management Network (TMN) and management of virtual private routed network, using forced routing “from the source”. The results of this work will be used to solve the problem of managing a network simulator, which is a complete configuration of the entire data network of a country.

2021 ◽  
Vol 13 (12) ◽  
pp. 321
Author(s):  
Dmitry Baranov ◽  
Alexandr Terekhin ◽  
Dmitry Bragin ◽  
Anton Konev

The determining factor in the accelerated pace of informatization is the increase in the speed and reliability of data transmission networks. In this regard, new and existing standards are developed and modernized. A lot of organizations are constantly working on the development and implementation of new generation communication networks. This article provides an overview of available software solutions that allow us to investigate and evaluate the behavior of data networks. In particular, tools suitable for mobile communication systems were determined, having sufficient built-in functionality and allowing us to add our own implementations. NS3 has been chosen as a suitable network simulator. Apart from the review, a solution for this tool was developed. It allows estimating the reliability of data transmission from the start movement of a network node at all times during its removal from a base station.


Author(s):  
С.Р. РОМАНОВ

Рассмотрен принцип управления сетью передачи данных (СПД)с помощью искусственной нейронной сети. Предложена концепция проведения вычислений при решении задачи оптимальной маршрутизации трафика данных. Приведен алгоритм управления сетью СПД на базе нейронной сети Хэмминга. The principle of data transmission network control using an artificial neural network is considered. The concept of carrying out calculations when solving the problem of optimal routing of data traffic is proposed. The algorithm for controlling the data transmission network based on the Hamming neural network is presented.


Vestnik NSUEM ◽  
2021 ◽  
pp. 31-36
Author(s):  
S. A. Khrustalyev

The publication deals with the design and modeling of fault tolerance for secured software-defined data transmission networks. A technique for evaluating the parameters of fault tolerance of a software-defined data transmission network is proposed. An organizational model for building a software-configurable data transmission network based on the design of a configuration based on the principle of dynamic protection with the use of selective transformation, taking into account the probability of failures and allowing to ensure high specified parameters of fault tolerance.


T-Comm ◽  
2021 ◽  
Vol 15 (9) ◽  
pp. 17-23
Author(s):  
Alexey S. Volkov ◽  
◽  
Aleksandr E. Baskakov ◽  

The paper describes the development of routing algorithm in software-defined communication networks using the principle of multi-path message delivery. The use of the OpenFlow protocol as the main one for connecting data- and control-plane devices between each other, that is, programmable switches with the controller, allows us to take the network topology presented in undirected weighted graph form as the initial data for the algorithm. There are known solutions to the problem of finding ways to transmit data in a communication network, as a rule, using the network resource reservation protocol, but additional restrictions are imposed on the network, since RSVP has a low degree of scalability, respectively, inappropriate consumption of computing resources and storage system resources of individual routers. In view of the above, an algorithm has been developed for finding a set of paths on a graph with the construction of an auxiliary graph based on the original one. Conditions are given under which an auxiliary graph can be constructed from the initial one. The algorithm takes into account the possibility of constructing several paths passing through one vertex, while meeting the requirements for the delay of the input data stream. To expand the functionality and possible areas of application of the algorithm for finding a set of paths, a criterion for the required total throughput by a set of data transmission paths is introduced. Conditions for constructing paths from a vertex to set of vertices are given. The algorithm presented in the work has an order of magnitude less time complexity, which allows you to quickly respond to changes in the data transmission network, while the most significant differences in the time spent on building a set of paths are noticeable with an increase in nodes in the data transmission network and the number of possible paths.


Author(s):  
I. M. Sribna ◽  
◽  
H. A. Kuchuk ◽  
O. H. Lebedyev ◽  
Frhat Ali Alnaeri ◽  
...  

An approach is proposed to reduce the load on the backbone channels of the data network. The scientific novelty lies in the improvement of the method for reducing the load of backbone channels by synthesizing the topological structure of its segments, which have the properties of local self-healing and scalability, and segment recovery and scaling occur without access to the backbone channels of the main network. The following tasks were solved: the structure of the primary regular communication network was formed, assuming the possibility of self-recovery; an algorithm for the formation of a secondary communication network of a local segment based on the existing primary regular network has been developed; the principles of local scaling are formulated; a method for local scaling of the topological structure of data transmission network segments is proposed; the comparative analysis of the load of the main channels of the data transmission network was carried out using the standard and the proposed variants of the synthesis of its local components. A regular graph with a given connectivity is used as the initial structure. Further transformations were carried out using a modified combinatorial optimization method. The topological features of the "grid" type graph are used to scale the segment. With a large number of segment switching nodes, the additional load on the trunk channels increases with the proposed approach more slowly than with the standard one. The main computational difficulties arise when applying the method of indefinite Lagrange multipliers. Therefore, the development of this study may consist in reducing the computational complexity of the algorithm for forming a secondary communication network of the segment under consideration.


2021 ◽  
Vol 3 (11) ◽  
pp. 73-84
Author(s):  
Viktor Semko ◽  
Oleksiy Semko

This paper proposes a method of synthesis of data transmission routes in conflicting heterogeneous self-organized wireless data networks under external and internal influences. In this case, routing is understood as the process of determining in a data transmission network one or a set of routes (pathspaths) , that are optimal within the selected criteria between a given pair or set of network nodes. Thus, a route is a sequence of network nodes and data transmission paths that connect a pair of network nodes for communication. The method is based on a mathematical model of the data network operation in a virtual multidimensional parameter space. The model of operation is based on a graph-model of information interaction of network nodes in the process of data transmission between receptor nodes and acceptors in the transmission of data streams. Based on the problem statement, the price function is formally defined as the value of the virtual distance between the nodes of a heterogeneous data network. In contrast to the Floyd-Warshall and Dijkstra algorithms, the synthesis of the data transmission route takes into account both the load of the computing environment of network nodes and the state of information interaction channels of network nodes, as well as possible changes in network parameters during data transmission. The data transmission network is self-organized, has no dedicated nodes, which ensures its reliability under external and internal influences, conflicts in data transmission, as well as variable topology. The proposed method for synthesizing data transmission routes when controlling the routing of data flows in heterogeneous networks is focused on the possibility of implementing the basic model of open systems interaction within the framework of existing protocols - the OSI model, which is a reference network model for communications and the development of network protocols.


Electronics ◽  
2021 ◽  
Vol 10 (10) ◽  
pp. 1138
Author(s):  
Yu Lu ◽  
Liu Chang ◽  
Jingwen Luo ◽  
Jia Wu

With the rapid popularization of 5G communication and internet of things technologies, the amount of information has increased significantly in opportunistic social networks, and the types of messages have become more and more complex. More and more mobile devices join the network as nodes, making the network scale increase sharply, and the tremendous amount of datatransmission brings a more significant burden to the network. Traditional opportunistic social network routing algorithms lack effective message copy management and relay node selection methods, which will cause problems such as high network delay and insufficient cache space. Thus, we propose an opportunistic social network routing algorithm based on user-adaptive data transmission. The algorithm will combine the similarity factor, communication factor, and transmission factor of the nodes in the opportunistic social network and use information entropy theory to adaptively assign the weights of decision feature attributes in response to network changes. Also, edge nodes are effectively used, and the nodes are divided into multiple communities to reconstruct the community structure. The simulation results show that the algorithm demonstrates good performance in improving the information transmission’s success rate, reducing network delay, and caching overhead.


2014 ◽  
Vol 977 ◽  
pp. 330-333
Author(s):  
Qi Lin Hao ◽  
Ping Xian Yang ◽  
Ming Jie Wang ◽  
Rui Ma

In this paper, in order to achieve real-time remote monitoring of fire site, we designed a intelligent remote fire monitoring system based on ZigBee network and GPRS network. This system, used ZigBee and sensor to build data acquisition and short distance transmission network and combined with GPRS wireless data transmission and SMS alarm ,cooperates with the server and PC to build a remote monitoring scheme based on GRPS.


Author(s):  
Maksim Peregudov ◽  
Anatoliy Steshkovoy

Currently, centrally reserved access to the medium in the digital radio communication networks of the IEEE 802.11 family standards is an alternative to random multiple access to the environment such as CSMA/CA and is mainly used in the transmission voice and video messages in real time. Centrally reserved access to the environment determines the scope of interest in it from attackers. However, the assessment of effectiveness of centrally reserved access to the environment under the conditions of potentially possible destructive impacts was not carried out and therefore it is impossible to assess the contribution of such impacts to the decrease in the effectiveness of such access. Also, the stage establishing of centrally reserved access to the environment was not previously taken into account. Analytical model development of centrally reserved access to the environment under the conditions of destructive influences in digital radio communication networks of the IEEE 802.11 family standards. A mathematical model of centrally reserved access to the environment has been developed, taking into account not only the stage of its functioning, but also the stage of formation under the conditions of destructive influences by the attacker. Moreover, in the model the stage of establishing centrally reserved access to the medium displays a sequential relationship of such access, synchronization elements in digital radio communication networks and random multiple access to the medium of the CSMA/CA type. It was established that collisions in the data transmission channel caused by destructive influences can eliminate centrally reserved access to the medium even at the stage of its establishment. The model is applicable in the design of digital radio communication networks of the IEEE 802.11 family of standards, the optimization of such networks of the operation, and the detection of potential destructive effects by an attacker.


2020 ◽  
Vol 6 (1) ◽  
pp. 100-108
Author(s):  
I. Kaisina

This paper investigates the process of multi-stream data transmission from several unmanned aerial vehicles (UAV) to a ground station. We can observe a mathematical model of the data transfer process at the application level of the OSI model (from flying nodes to a ground station). The Poisson – Pareto packet process is used to describe the multi-stream data traffic. The results of simulation are obtained using the network simulator NS-3. It is considered a system for emulating the process of multi-stream data transmission from UAV to a ground station. Acording to the results of studies for multi-stream data transmission it is clear that the increase of the UAV source nodes which simultaneously transmit data to a ground station needs higher requirements for Goodput.


Sign in / Sign up

Export Citation Format

Share Document