scholarly journals DEVELOPMENT OF A MULTIPATH ROUTING ALGORITHM IN SOFTWARE-DEFINED COMMUNICATION NETWORKS

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.

Symmetry ◽  
2018 ◽  
Vol 10 (11) ◽  
pp. 600 ◽  
Author(s):  
Genghua Yu ◽  
Zhigang Chen ◽  
Jia Wu ◽  
Jian Wu

The amount of data has skyrocketed in Fifth-generation (5G) networks. How to select an appropriate node to transmit information is important when we analyze complex data in 5G communication. We could sophisticate decision-making methods for more convenient data transmission, and opportunistic complex social networks play an increasingly important role. Users can adopt it for information sharing and data transmission. However, the encountering of nodes in mobile opportunistic network is random. The latest probabilistic routing method may not consider the social and cooperative nature of nodes, and could not be well applied to the large data transmission problem of social networks. Thus, we quantify the social and cooperative relationships symmetrically between the mobile devices themselves and the nodes, and then propose a routing algorithm based on an improved probability model to predict the probability of encounters between nodes (PEBN). Since our algorithm comprehensively considers the social relationship and cooperation relationship between nodes, the prediction result of the target node can also be given without encountering information. The neighbor nodes with higher probability are filtered by the prediction result. In the experiment, we set the node’s selfishness randomly. The simulation results show that compared with other state-of-art transmission models, our algorithm has significantly improved the message delivery rate, hop count, and overhead.


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.


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.


2015 ◽  
Vol 727-728 ◽  
pp. 996-999 ◽  
Author(s):  
Su Xia Cui

The issue of WDM network traffic grooming has been a hot in the field of research. The implementation of traffic grooming technology can improve the utilization of wavelength channels, reducing the link delay and the blocking rate of the network, which to improve network resource utilization and optimize network performance. This article mainly studies all-optical network routing algorithm utilizing WDM technology to achieve the dynamic traffic grooming and propose a optimization grooming policy -HaffmanGroom (M) algorithms which based on SONET / WDM ring network. The most important feature of this algorithm is that the SONET / WDM ring network of multiple multicast request packet , with a minimum weight of the light path priority selection method, the flow of requests each group effectively optimize ease . The algorithm takes into account the impact of the link request factor and link hops to optimize the link selection. The simulation results show that under the conditions of factors and the number of hop a request fully consider the impact of these two factors to the link, and can achieve optimal link with the smallest weights for effective data transmission, improving resource utilization, reducing blocking rate in order to achieve the purpose of optimizing network performance.


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):  
С.Р. РОМАНОВ

Рассмотрен принцип управления сетью передачи данных (СПД)с помощью искусственной нейронной сети. Предложена концепция проведения вычислений при решении задачи оптимальной маршрутизации трафика данных. Приведен алгоритм управления сетью СПД на базе нейронной сети Хэмминга. 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.


2017 ◽  
Vol 13 (04) ◽  
pp. 45 ◽  
Author(s):  
Liping LV

<p class="0abstract"><span lang="EN-US">Wireless sensor network is a new field of computer science and technology research. It has a very broad application prospects. In order to improve the network survival time, it is very important to design efficient energy-constrained routing protocols. In this paper, we studied the characteristics of wireless sensor networks, and analyzed the design criteria of sensor network routing algorithms. In view of the shortcomings of traditional algorithms, we proposed an energy-aware multi-path algorithm. When selecting a data transmission path, the energy-aware multi-path algorithm can avoid nodes with low energy levels. At the same time, it takes the remaining energy of the node and the number of hops as one of the measures of the path selection. The multi-path routing algorithm realized the low energy consumption of the data transmission path, thus effectively prolonging the network lifetime. Compared with the traditional algorithm, the results show that our method has high reliability and energy efficiency.</span></p>


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.


2021 ◽  
Vol 6 (1(34)) ◽  
pp. 27-29
Author(s):  
D.A. Oskin ◽  
A.A. Gorshkov ◽  
S.A. Klimenko

The principles of construction and operation of the data collection and transmission system (DCTS) of an unmanned vessel are considered. A two-stage formulation of the problem of constructing a DCTS is proposed: the choice of methods and means of transmitting data from sensors to the data collection system, the choice of a method for transmitting data to the data collection system, the implementation of data transmission channels and, directly, the organization of data collection and storage for use in the autopilot device, implementation systems for receiving and synchronizing data and their placement in the storage system.


Sign in / Sign up

Export Citation Format

Share Document