RU2731437C1 - Method, apparatus and system for optimizing unbalanced transport communication network - Google Patents

Abstract

FIELD: computer equipment.

SUBSTANCE: invention relates to computer engineering. Device comprises: a parameter collection/output module configured to receive information from a communication network, at least an average delay time and communication channel availability coefficients, information from the access network, at least, the average size of the protocol data units and the intensity of the arrival of the protocol data units of 1^st, 2^nd and so on up to the k^th priority, allowable network delays for the protocol data units of 1^st, 2^nd and so on up to k^th priority, information on network elements of unbalanced transport communication network, transmitting switching/routing tables, topology and resource management to network elements, a routing module configured to locate communication structures of an unbalanced transport communication network, a topology synthesis module.

EFFECT: technical result consists in reducing the number of arithmetic operations when finding optimum capacity values of communication channels.

4 cl, 3 tbl, 5 dwg

Description

The proposed technical solutions are united by a single inventive concept and relate to the field of telecommunication communication networks, in particular, to the synthesis of a transport communication network with packet switching.

For the convenience of describing the method, device and system for optimizing an unbalanced transport communication network, we introduce a number of definitions.

A logical channel is a path through which data is transmitted from one port to another (see Yakubaitis, E.A. Information networks and systems: reference book / E.A. Yakubaitis. - Moscow: finance and statistics, 1996. - 118 p. ).

The procedure for two end nodes of the network to agree on some parameters of the packet exchange process is called establishing a logical connection. The parameters that two interacting nodes agree on are called the parameters of the logical connection (see Olifer, V.G. Computer networks. Principles, technologies, protocols: textbook for universities / V.G. Olifer, N.A. Olifer. - 5th edition - St. Petersburg: Peter, 2017 .-- 90 p.).

Protocol data unit (PDU) is a data unit transferred between logical objects of the same level (see GOST 24402-88).

In this work, by a transport communication network unbalanced in terms of priorities, we mean such a transport communication network in which the ordered sequences of information directions obtained as a result of ranking according to the intensities of protocol data blocks of different priorities do not coincide.

The functioning of modern transport communication networks is characterized by the presence of a large number of information directions. In each information direction, data traffic of different priority is transmitted, while the rates of arrival of protocol data units of different priorities can differ significantly. In addition, each priority has individual requirements for the permissible network delay of the protocol data units. Therefore, the task of distributing the bandwidth of communication channels of an unbalanced transport communication network is important and affects the functioning of the entire transport communication network as a whole.

There is a known method, device and module for optimizing remote control of home network devices (patent RU 2482613 dated 20.05.2003), a method for controlling a home network is disclosed, which is connected by a gateway device of a home network to an external network, and the said external network contains at least one auto-configuration server (ACS), designed and executed to provide automatic configuration of the said device. The method comprises monitoring sessions between at least one said device and at least one ACS in a gateway device of a home network, wherein said device is a TR-069-compliant device, and said sessions are TR-069 sessions, and said control contains interpretation and, if necessary, decoding of TR-069 sessions in order to extract configuration information for TR-069-enabled devices.

A known method, device and system for joint optimization (RU 2520354 dated 06/10/2014) A method for joint optimization, which consists in the fact that they receive information about the communication line, information about the server and bandwidth, information about the user's requirements in the subnet, obtain the optimal parameter routing and subnet server selection parameter according to the previously obtained link information, server and bandwidth information, user requirements information, obtain the optimal input bandwidth of each external subnet port, compare the optimized input bandwidth of the virtual server of each external port, and if the comparison between the optimized ingress bandwidth and the virtual server bandwidth of all external ports is less than the specified error value, the optimal routing option and the subnet server selection option are applied. The joint optimization device contains a parameter collection module configured to obtain information about the communication line, information about the server and bandwidth and information about the user's requirements in the subnet, where the information about the server and the bandwidth includes information about the bandwidth of the virtual server for each external subnet port and throughput of the virtual server is the throughput of the out-of-subnet virtual server, and where the out-of-subnet server throughput is that which is required by the subnet through the external port, the computing engine is configured to obtain the optimal routing parameter and the subnet server selection parameter according to information about the communication line, information about the server and bandwidth, and information about the user's requirements, and obtaining the optimized input bandwidth of each external port of the subnet in accordance with the optimal parameter routing and server selection parameter and an output module configured to compare the optimized input bandwidth and the virtual server bandwidth for each external port, and if the comparison result of the optimized input bandwidth and the server bandwidth for all external ports is less than the specified error value, the application the optimal routing parameter and the server selection parameter on the subnet, and displays the optimal routing parameter and the server selection parameter. The joint optimization system contains a computing device configured to collect information about the communication line, information about the server and bandwidth and information about user requirements, obtain the routing parameter and the server selection parameter, and obtain the optimized input bandwidth and optimized output bandwidth of each port and the mechanism routing, configured to convert a routing parameter and a server selection parameter obtained by the joint optimization computing device into a routing parameter and a server selection parameter used in the local network.

The closest in technical essence to the claimed method and selected as a prototype is a method for optimizing the transport communication network (patent RU 2680764 dated 03/06/2018), which consists in the fact that they receive information from the communication operator's network, at least the average delay time and coefficients availability of communication lines, information from the access network, at least the average size of the protocol data units and the intensity of the arrival of the protocol data units, the requirements for the quality of service, information about the network elements of the transport communication network, find the connected structures for the transport communication network according to the criterion of the minimum average delay time for of the corresponding connected structure, calculate the optimal logical structure of the transport communication network, using information from the network of the communication operator, at least the average delay time and availability factors of communication lines, information about the network elements of the transport communication network, information about the found connected structures n on the criterion of the minimum average delay time for the corresponding connected structures, find the connected structures on the optimal logical structure of the transport communication network according to the criterion of the maximum availability factor for the corresponding connected structures, calculate the optimal distribution of the bandwidth of the logical channels of the transport communication network, using information from the access network, as minimum average size of protocol data units and intensity of receipt of protocol data units, requirements for quality of service, fill in the switching tables, topology and resource management of the transport communication network, transmit switching tables, topology and resource management to the network elements of the transport communication network

The closest in technical essence to the claimed device and selected as a prototype is a device for optimizing the transport communication network (patent RU 2680764 dated 03/06/2018), which contains a module for collecting / outputting parameters, made with the ability to receive information from the operator's network, at least the average delay time and availability of communication lines, information from the access network, at least the average size of the protocol data units and the rate of arrival of the protocol data units, quality of service requirements, information about the network elements of the transport communication network, transmission of switching tables to network elements, topology and resource management, a module for finding connected structures, configured to find connected structures of a transport communication network according to the criterion of the minimum average delay time for the corresponding connected structure and according to the criterion of maximum availability for the corresponding connected structures, the module structural optimization, made with the possibility of calculating the optimal logical structure of the transport communication network, using information from the operator's network, at least the average delay time and availability factors of communication lines, information about the network elements of the transport communication network, information about the found connected structures according to the minimum criterion the average delay time for the corresponding connected structures, a parametric optimization module, made with the ability to calculate the optimal distribution of the bandwidth of the logical channels of the transport communication network, using information from the access network, at least the average size of the protocol data units and the intensity of the arrival of the protocol data units, quality requirements service, the content module, configured to fill the switching tables, topology and resource management of the transport communication network and transfer the table data to the module for collecting / outputting parameters.

The closest in technical essence to the claimed system and selected as a prototype is a system for optimizing the transport communication network (patent RU 2680764 dated 06.03.2018), which contains a device for optimizing the transport communication network, at least three network elements made with the possibility of filling the tables of switching, topology and resource management of the transport communication network, and each network element is connected to a device for optimizing the transport communication network by a control channel, the network elements are connected to each other by physical and logical communication channels.

-го приоритета.The technical problem of these analogs and prototypes is a large number of arithmetic operations in finding the optimal values of the bandwidth of the communication channels of the transport communication network. Another technical problem is that analogs and the prototype do not allow finding the optimal values of the bandwidth of communication channels in an unbalanced transport communication network, while fulfilling the requirements for the permissible network delay for protocol data blocks of both the 1st and 2nd, and so further up to

-th priority.

-го приоритета, допустимых сетевых задержек для протокольных блоков данных 1-го, 2-го и так далее вплоть до

-го приоритета, информации о сетевых элементах транспортной сети связи из скалярного вида в матричный вид и обратно, в модуле преобразования данных, нахождения оптимальных значений пропускных способностей каналов связи разбалансированной транспортной сети с использованием математического аппарата матричного исчисления и обобщенного метода неопределенных множителей Лагранжа, в модуле управления сетевыми ресурсами разбалансированной транспортной сети.The technical result is a decrease in the number of arithmetic operations when finding the optimal values of the bandwidth of communication channels of an unbalanced transport communication network by converting the information received from the operator's network, at least the average delay time and readiness coefficients of communication channels, information from the access network, at least the average size of the protocol data blocks and the arrival rate of protocol data blocks 1, 2, and so on up to

-th priority, acceptable network delays for PDUs 1, 2, and so on up to

-th priority, information about network elements of the transport communication network from scalar form to matrix form and vice versa, in the data conversion module, finding the optimal values of the bandwidth of communication channels of an unbalanced transport network using the mathematical apparatus of the matrix calculus and the generalized method of indefinite Lagrange multipliers, in the module management of network resources of an unbalanced transport network.

-го приоритета за счет системы для оптимизации разбалансированной транспортной сети, которая содержит устройство для оптимизации разбалансированной транспортной сети связи, как минимум пять сетевых элементов, выполненных с возможностью заполнения таблиц коммутации/маршрутизации, топологии и управления ресурсом разбалансированной транспортной сети связи, причем каждый сетевой элемент соединен с устройством для оптимизации разбалансированной транспортной сети связи каналом управления или логическим каналом управления, а сетевые элементы соединены друг с другом каналами связи.Another technical result is that the present invention makes it possible to find the optimal values of the bandwidth of communication channels in an unbalanced transport communication network, while fulfilling the requirements for the permissible network delay for protocol data units of both the 1st and 2nd, and so on up to before

-th priority due to the system for optimizing the unbalanced transport network, which contains a device for optimizing the unbalanced transport communication network, at least five network elements made with the ability to fill the switching / routing tables, topology and resource management of the unbalanced transport communication network, with each network element connected to a device for optimizing an unbalanced transport communication network by a control channel or a logical control channel, and network elements are connected to each other by communication channels.

-го приоритета. The objective of the invention is to create a method, device and system for optimizing an unbalanced transport communication network, allowing to reduce the number of arithmetic operations when finding optimal values of the bandwidth of communication channels of an unbalanced transport network and to find the optimal values of the bandwidth of communication channels in an unbalanced transport network, while fulfilling the requirements for permissible network delay for PDUs 1 and 2, and so on up to

-th priority.

-го приоритета, допустимые сетевые задержки для протокольных блоков данных 1-го, 2-го и так далее вплоть до

-го приоритета, информацию о сетевых элементах разбалансированной транспортной сети связи. Определяют связные структуры для разбалансированной транспортной сети связи по критерию минимума среднего времени задержки для соответствующей связной структуры. Вычисляют оптимальную логическую структуру разбалансированной транспортной сети связи, с использованием информации от сети оператора связи, как минимум среднего времени задержки и коэффициентов готовностей каналов связи, информации о сетевых элементах разбалансированной транспортной сети связи, информации о найденных связных структурах по критерию минимума среднего времени задержки для соответствующих связных структур. Находят связные структуры на оптимальной логической структуре разбалансированной транспортной сети связи по критерию максимума коэффициента готовности для соответствующих связных структур. Формируют таблицы коммутации/маршрутизации, топологии и управления ресурсом разбалансированной транспортной сети связи в матричном виде, передают сетевым элементам разбалансированной транспортной сети связи таблицы коммутации/маршрутизации, топологии и управления ресурсом. Дополнительно преобразуют полученную информацию от сети оператора связи, как минимум среднее время задержки и коэффициенты готовностей каналов связи, информацию от сети доступа, как минимум средний размер протокольных блоков данных и интенсивности поступления протокольных блоков данных 1-го, 2-го и так далее вплоть до

-го приоритета, допустимые сетевые задержки для протокольных блоков данных 1-го, 2-го и так далее вплоть до

-го приоритета, информацию о сетевых элементах разбалансированной транспортной сети связи из скалярного вида в матричный вид, а после того, как сформируют таблицы коммутации/маршрутизации, топологии и управления ресурсом разбалансированной транспортной сети связи преобразуют данные таблицы в скалярный вид. Находят оптимальные значения пропускных способностей каналов связи разбалансированной транспортной сети, с использованием информации от сети доступа, как минимум среднего размера протокольных блоков данных и интенсивности поступления протокольных блоков данных 1-го, 2-го и так далее вплоть до

-го приоритета, допустимых сетевых задержек для протокольных блоков данных 1-го, 2-го и так далее вплоть до

-го приоритета, с использованием математического аппарата матричного исчисления и обобщенного метода неопределенных множителей Лагранжа.In the claimed method, this problem is solved in that the method for optimizing an unbalanced transport communication network, which consists in the fact that they receive information from the operator's network, at least the average delay time and the availability factors of communication channels, information from the access network, at least the average size protocol data blocks and the arrival rate of protocol data blocks 1, 2, and so on up to

-th priority, allowable network delays for PDUs 1, 2, and so on up to

-th priority, information about network elements of an unbalanced transport communication network. Connected structures for an unbalanced transport communication network are determined according to the criterion of the minimum average delay time for the corresponding connected structure. The optimal logical structure of an unbalanced transport communication network is calculated using information from the operator's network, at least the average delay time and availability factors of communication channels, information about network elements of an unbalanced transport communication network, information about the found connected structures by the criterion of the minimum average delay time for the corresponding connected structures. Connected structures are found on the optimal logical structure of an unbalanced transport communication network according to the criterion of maximum availability for the corresponding connected structures. The tables of switching / routing, topology and resource management of the unbalanced transport communication network are formed in matrix form, the switching / routing tables, topology and resource management are transmitted to the network elements of the unbalanced transport communication network. Additionally, the received information from the operator's network is converted, at least the average delay time and the availability factors of communication channels, information from the access network, at least the average size of the protocol data blocks and the intensity of the arrival of the protocol data blocks of the 1st, 2nd and so on up to

-th priority, allowable network delays for PDUs 1, 2, and so on up to

-th priority, information about the network elements of the unbalanced transport communication network from scalar form to matrix form, and after the tables for switching / routing, topology and resource management of the unbalanced transport communication network are formed, the table data is converted into scalar form. The optimal values of the throughput of communication channels of an unbalanced transport network are found, using information from the access network, at least the average size of protocol data units and the intensity of arrival of protocol data units 1, 2, and so on up to

-th priority, acceptable network delays for PDUs 1, 2, and so on up to

-th priority, using the mathematical apparatus of the matrix calculus and the generalized method of indefinite Lagrange multipliers.

According to one of the particular variants of implementation, when finding the optimal values of the bandwidth of communication channels of an unbalanced transport network, at least the following stages are carried out:

-го приоритета.1) at the first stage, the optimal values of the bandwidth of the communication channels of the unbalanced transport network are determined, taking into account the permissible network delay only for protocol data units of the 1st priority, then only for the 2nd priority, and so on up to

-th priority.

2) at the second stage, sets of values of the bandwidth of communication channels of an unbalanced transport network are determined, taking into account all possible combinations of admissible network delays for protocol data units of only two priorities, then only for three priorities, and so on until all combinations of admissible network delays for PDUs of all priorities.

3) at the third stage, a set of alternative solutions to the parametric optimization problem is determined, for this, the maximum values of the bandwidth of the communication channels of the unbalanced transport communication network are selected using the sets of bandwidth values that were determined at the second stage.

4) at the fourth stage, from the set of solutions obtained at the third stage, an optimal solution is selected that provides: fulfillment of the requirements for admissible network delays for protocol data units of all priorities and the minimum total costs associated with the lease of communication channels of the corresponding bandwidth.

-го приоритета, допустимых сетевых задержек для протокольных блоков данных 1-го, 2-го и так далее вплоть до

-го приоритета, информации о сетевых элементах разбалансированной транспортной сети связи из скалярного вида в матричный вид, нахождения значений пропускных способностей каналов связи разбалансированной транспортной сети связи, с использованием информации от сети доступа, как минимум среднего размера протокольных блоков данных и интенсивности поступления протокольных блоков данных 1-го, 2-го и так далее вплоть до

-го приоритетов, допустимых сетевых задержек для протокольных блоков данных 1-го, 2-го и так далее вплоть до

-го приоритетов, с использованием математического аппарата матричного исчисления и обобщенного метода неопределенных множителей Лагранжа.The new set of essential features makes it possible to achieve the specified technical result by transforming the information received from the operator's network, at least the average delay time and readiness coefficients of communication channels, information from the access network, at least the average size of the protocol data blocks and the rate of receipt of the protocol data blocks 1- 1st, 2nd and so on up to

-th priority, acceptable network delays for PDUs 1, 2, and so on up to

-th priority, information about the network elements of an unbalanced transport communication network from scalar form to matrix form, finding the values of the bandwidth of communication channels of an unbalanced transport communication network, using information from the access network, at least the average size of protocol data blocks and the intensity of receipt of protocol data blocks 1st, 2nd and so on up to

-th priorities, acceptable network delays for PDUs 1, 2, and so on up to

-th priorities, using the mathematical apparatus of matrix calculus and the generalized method of indefinite Lagrange multipliers.

-го приоритета, допустимых сетевых задержек для протокольных блоков данных 1-го, 2-го и так далее вплоть до

-го приоритета, информации о сетевых элементах разбалансированной транспортной сети связи, передачи сетевым элементам таблиц коммутации/маршрутизации, топологии и управления ресурсом. Модуль маршрутизации, выполненный с возможностью нахождения связных структур разбалансированной транспортной сети связи по критерию минимума среднего времени задержки для соответствующей связной структуры и по критерию максимума коэффициента готовности для соответствующих связных структур. Модуль синтеза топологии, выполненный с возможностью вычисления оптимальной логической структуры разбалансированной транспортной сети связи, с использованием информации от сети оператора связи, как минимум среднего времени задержки и коэффициентов готовностей каналов связи, информации о сетевых элементах разбалансированной транспортной сети связи, информации о найденных связных структурах по критерию минимума среднего времени задержки для соответствующей связной структуры. Модуль данных, выполненный с возможностью заполнения таблиц коммутации/маршрутизации, топологии и управления ресурсом разбалансированной транспортной сети связи и передачи данных таблиц в модуль сбора/вывода параметров. Модуль административного управления, выполненный с возможностью управления и конфигурирования устройства, вывода информации на монитор служебной информации. Дополнительно включены модуль матричных операций, предназначенный для реализации математического аппарата матричного исчисления, модуль управления сетевыми ресурсами, выполненный с возможностью нахождения оптимальных значений пропускных способностей каналов связи разбалансированной транспортной сети связи, с использованием информации от сети доступа, как минимум среднего размера протокольных блоков данных и интенсивности поступления протокольных блоков данных 1-го, 2-го и так далее вплоть до

-го приоритета, допустимых сетевых задержек для протокольных блоков данных 1-го, 2-го и так далее вплоть до

-го приоритета, с использованием обобщенного метода неопределенных множителей Лагранжа, модуль преобразования данных, выполненный с возможностью преобразования полученной информации от сети оператора связи, как минимум среднего времени задержки и коэффициентов готовностей каналов связи, информации от сети доступа, как минимум среднего размера протокольных блоков данных и интенсивности поступления протокольных блоков данных 1-го, 2-го и так далее вплоть до

-го приоритета, допустимых сетевых задержек для протокольных блоков данных 1-го, 2-го и так далее вплоть до

-го приоритета, информации о сетевых элементах разбалансированной транспортной сети связи из скалярного вида в матричный вид, а также таблиц коммутации/маршрутизации, топологии и управления ресурсом разбалансированной транспортной сети связи из матричного вида в скалярный вид, при этом все модули в устройстве соединены посредством общей внутренней шины AXI4, которая выступает в качестве средства обмена информацией между модулями.In the claimed device, this problem is solved by the fact that a device for optimizing an unbalanced transport communication network containing a module for collecting / outputting parameters, configured to receive information from the operator's network, at least the average delay time and availability of communication channels, information from the access network, at least the average size of PDUs and the arrival rate of PDUs 1, 2, and so on up to

-th priority, acceptable network delays for PDUs 1, 2, and so on up to

-th priority, information about network elements of an unbalanced transport communication network, transferring switching / routing tables, topology and resource management to network elements. A routing module made with the possibility of finding the connected structures of an unbalanced transport communication network according to the criterion of the minimum average delay time for the corresponding connected structure and according to the criterion of the maximum availability for the corresponding connected structures. A topology synthesis module capable of calculating the optimal logical structure of an unbalanced transport communication network using information from the carrier's network, at least the average delay time and availability factors of communication channels, information about network elements of an unbalanced transport communication network, information about the found communication structures by the criterion for the minimum average delay time for the corresponding connected structure. A data module configured to fill in the switching / routing tables, topology and resource management of an unbalanced transport communication network and transfer the table data to the parameter collection / output module. Administrative control module, configured to control and configure the device, output information to the service information monitor. Additionally included are a matrix operations module designed to implement the mathematical apparatus of matrix calculus, a network resource management module configured to find the optimal values of the bandwidth of communication channels of an unbalanced transport communication network using information from the access network, at least the average size of protocol data blocks and intensity arrival of protocol data blocks 1, 2, and so on up to

-th priority, acceptable network delays for PDUs 1, 2, and so on up to

-th priority, using the generalized method of indefinite Lagrange multipliers, a data conversion module capable of converting the information received from the operator's network, at least the average delay time and availability factors of communication channels, information from the access network, at least the average size of protocol data blocks and the intensity of the arrival of protocol data blocks 1, 2, and so on up to

-th priority, acceptable network delays for PDUs 1, 2, and so on up to

-th priority, information about network elements of an unbalanced transport communication network from scalar form to matrix form, as well as switching / routing tables, topology and resource management of an unbalanced transport communication network from matrix form to scalar form, while all modules in the device are connected through a common internal bus AXI4, which acts as a means of information exchange between modules.

-го приоритета.Thanks to a new set of essential features, the specified technical result is achieved due to the additionally introduced module of matrix operations, a module for managing network resources, a data conversion module, which makes it possible to reduce the number of arithmetic operations when finding the optimal values of the bandwidth of communication channels of an unbalanced transport network and to find the optimal values of the bandwidth of channels communication in an unbalanced transport communication network, while fulfilling the requirements for the permissible network delay for protocol data blocks of both the 1st and 2nd, and so on up to

-th priority.

In the claimed system, this problem is solved by the fact that in the system for optimizing an unbalanced transport communication network, consisting of a device for optimizing an unbalanced transport communication network, at least five network elements made with the ability to fill in the switching / routing tables, topology and resource management of the unbalanced transport network communication, each network element is connected to a device for optimizing an unbalanced transport communication network by a control channel or a logical control channel, the network elements are connected to each other by communication channels.

-го приоритета.Thanks to a new set of essential features, the specified technical result is achieved through the use of a system for optimizing an unbalanced transport network, which contains a device for optimizing an unbalanced transport network, at least five network elements made with the ability to fill in the switching / routing tables, topology and resource management of an unbalanced transport network communication, each network element is connected to a device for optimizing an unbalanced transport communication network by a control channel or a logical control channel, the network elements are connected to each other by communication channels, which makes it possible to reduce the number of arithmetic operations when finding the optimal values of the capacity of communication channels of an unbalanced transport network and to find optimal values of the bandwidth of communication channels in an unbalanced transport communication network, while fulfilling the requirements for the permissible network back delays for PDUs 1 and 2, and so on up to

-th priority.

The analysis of the state of the art made it possible to establish that there are no analogs characterized by a set of features that are identical to all features of the claimed method, device and system for optimizing an unbalanced transport communication network. Therefore, the claimed invention meets the “novelty” requirement of patentability.

The results of the search for known solutions in this and related fields of technology in order to identify features that match the distinctive features of the prototype of the features of the claimed object, have shown that they do not follow explicitly from the prior art. The prior art also did not reveal the influence of the transformations envisaged by the essential features of the claimed invention on the achievement of the specified technical result. Therefore, the claimed invention meets the "inventive step" requirement of patentability.

To more clearly illustrate technical solutions according to embodiments of the present invention, a brief description of the accompanying drawings is provided below. Obviously, the accompanying drawings in the following description relate only to certain embodiments of the present invention, and those skilled in the art can easily derive other drawings based on these accompanying drawings.

in fig. 1 - a way to optimize an unbalanced transport communication network;

in fig. 2 - device for optimizing an unbalanced transport communication network;

in fig. 3 - a system for optimizing an unbalanced transport communication network;

in fig. 4 - a fragment of an unbalanced transport communication network;

in fig. 5 - optimal logical structures of an unbalanced transport communication network.

Below, technical solutions for embodiments of the present invention will be fully and clearly described with reference to the accompanying drawings. It should be obvious that the embodiments described below are only part of the present invention and not all possible embodiments of the present invention. All other embodiments obtained by those skilled in the art based on the embodiments of the present invention and not using creativity fall within the protection scope of the present invention.

The implementation of the claimed method is as follows (Fig. 1).

-го приоритетов, допустимые сетевые задержки для протокольных блоков данных 1-го, 2-го и

-го приоритетов, информацию о сетевых элементах разбалансированной транспортной сети связи.101. Receive information from the operator's network, at least the average delay time and the availability factors of communication channels, information from the access network, at least the average size of the protocol data blocks and the intensity of the arrival of the 1st, 2nd and 2nd protocol data blocks.

-th priorities, allowable network delays for protocol data units 1, 2 and

-th priorities, information about network elements of an unbalanced transport communication network.

-го приоритета, допустимые сетевые задержки для протокольных блоков данных 1-го, 2-го и так далее вплоть до

-го приоритета, информацию о сетевых элементах разбалансированной транспортной сети связи из скалярного вида в матричный вид, а после того, как сформируют таблицы коммутации/маршрутизации, топологии и управления ресурсом разбалансированной транспортной сети связи преобразуют данные таблицы в скалярный вид.102. Transform the information received from the operator's network, at least the average delay time and availability factors of communication lines, information from the access network, at least the average size of the protocol data blocks and the intensity of the arrival of the 1st, 2nd and so on protocol data blocks before

-th priority, allowable network delays for PDUs 1, 2, and so on up to

-th priority, information about the network elements of the unbalanced transport communication network from scalar form to matrix form, and after the tables for switching / routing, topology and resource management of the unbalanced transport communication network are formed, the table data is converted into scalar form.

103. Determine the connected structures for the unbalanced transport communication network according to the criterion of the minimum average delay time for the corresponding connected structure.

104. Calculate the optimal logical structure of an unbalanced transport communication network, using information from the operator's network, at least the average delay time and availability factors of communication channels, information about network elements of an unbalanced transport communication network, information about the found connected structures according to the criterion of minimum average delay time for the corresponding connected structures.

As an example, let us explain a generalized algorithm that computes the optimal logical structure by the branch and bound method, which includes five steps.

D1. A list of combinations is formed, which contains only one empty combination (a state when no resource is assigned to any element of the communication network). For this combination, the most reliable and most unreliable resource is determined in the unused resource and the upper and lower bounds are calculated for the value of the availability factor of the transport communication network.

D 2. The next combination is selected from the list of combinations, on the basis of which new combinations are formed by considering all possible options for assigning a resource from the list of resources to the next element of the transport communication network, but taking into account the already used resource.

D3. For each new combination, an unused resource is found, in which the most reliable and most unreliable resource is determined, and the upper and lower bounds of the value of the availability factor of the transport communication network are calculated.

D4. If there are not considered combinations in the list of combinations, then return to D2. If all combinations in the list are considered, then in the new list of combinations the highest value of the lower bound of the availability of the transport communication network is determined. After that, all the values of the upper bounds of the availability factor of the transport communication network are compared with this value, while the combinations for which the value of the upper bounds is less are removed from the new list of combinations as not promising.

The calculation of the upper and lower boundaries of the value of the availability factor of the transport communication network is carried out according to the method described in GOST R 55111-2008.

For clarity, FIG. 5 shows the optimal logical structures obtained using the shortest routes (Fig. 5a), spanning trees (Fig. 5b), Hamiltonian chains (Fig. 5c) and cycles (Fig. 5d).

105. Find connected structures on the optimal logical structure of an unbalanced transport communication network according to the criterion of the maximum availability factor for the corresponding connected structures.

-го приоритета, допустимых сетевых задержек для протокольных блоков данных 1-го, 2-го и так далее вплоть до

-го приоритета, с использованием математического аппарата матричного исчисления и обобщенного метода неопределенных множителей Лагранжа.106. Find the optimal values of the bandwidth of the communication channels of the unbalanced transport network, using information from the access network, at least the average size of the protocol data blocks and the intensity of the arrival of the 1st, 2nd, and so on up to

-th priority, acceptable network delays for PDUs 1, 2, and so on up to

-th priority, using the mathematical apparatus of the matrix calculus and the generalized method of indefinite Lagrange multipliers.

Finding the optimal distribution of the bandwidth of communication channels of an unbalanced transport communication network includes 4 stages.

-го приоритета.Stage 1. The optimal values of the bandwidth of communication channels of an unbalanced transport network are determined, taking into account the admissible network delay only for protocol data units of the 1st priority, then only for the 2nd priority, and so on up to

-th priority.

-го приоритета.As an example, let us explain stage 1, which implements the calculation of the optimal value of the bandwidth of communication channels of an unbalanced transport network, taking into account the permissible network delay only for protocol data units (PDUs) of the 1st priority or only

-th priority.

D1. Calculate the initial values of the bandwidth of communication channels (CS) using the mathematical apparatus of the matrix calculus

, (1)

, (1)

– вектор-столбец начальных значений пропускных способностей каналов связи;

– вектор-столбец среднего размера

ПБД для отдельных КС (бит);

 – вектор-столбец стоимости

аренды единицы пропускной способности для отдельных КС (

);

 – вектор-столбец задержки распространения

ПБД для отдельных КС (с);

– вектор-строка интенсивности

ПБД

-го приоритета, если

, тогда это усредненная интенсивность ПБД по всем приоритетам (1/с);

 – вектор-строка допустимых значений математического ожидания задержки

ПБД

-го приоритета, если

это усредненное допустимое значение математического ожидания задержки по всем приоритетам (с);

– матрица интенсивностей

поступления ПБД

-го приоритета в

-й канал связи, если

это усредненная интенсивность ПБД по всем приоритетам (1/с);Where

- a column vector of the initial values of the communication channel capacities;

- column vector of average size

PBD for individual CS (bits);

- column vector of cost

lease of a unit of throughput for individual compressor stations (

);

Is the column vector of propagation delay

PBB for individual CS (s);

Is the intensity row vector

PBB

-th priority if

, then this is the average PBU rate over all priorities (1 / s);

Is a row vector of admissible values of the expected delay

PBB

-th priority if

this is the average acceptable value of the mathematical expectation of the delay for all priorities (s);

- intensity matrix

PBB receipts

-th priority in

-th communication channel, if

this is the average PBB rate over all priorities (1 / s);

D 2. The vector of values of the throughput of communication channels is calculated at the next iterative step, provided that the requirements are met only for the admissible network delay of the 1st priority PDU, using the mathematical apparatus of the matrix calculus

, (2)

, (2)

 – вектор-столбец пропускных способностей

отдельных КС (бит/с). Рассчитывают вектор значений пропускных способностей каналов связи на очередном итерационном шаге при условии выполнения требований только для допустимой сетевой задержки ПБД

-го приоритета, используя математический аппарат матричного исчисленияWhere

- column vector of capacities

individual COPs (bit / s). The vector of values of the throughput of communication channels is calculated at the next iterative step, provided that the requirements are met only for the admissible network delay of the PDU

-th priority using the mathematical apparatus of matrix calculus

. (3)

... (3)

D3. Calculate the sum of the modulus of the deviation between the communication channel capacities obtained at the previous and next iterative steps, using the mathematical apparatus of the matrix calculus

, (4)

, (4)

возвращает число строк в матрице

, функция

возвращает единичную матрицу размером

.where function

returns the number of rows in a matrix

, function

returns the identity matrix of size

...

, т.е. сумма модуля отклонения между пропускными способностями каналов связи, полученными на предыдущем и очередном итерационных шагах, больше чем 0,1 бит/с. Если условие не выполняется, то оптимальные значения пропускных способностей каналов связи найдены. Иначе повторяются Д2–Д3 до тех пор, пока не будет выполнено условие в Д4.D4. Check the condition

, i.e. the sum of the modulus of the deviation between the communication channel capacities obtained at the previous and the next iteration steps is greater than 0.1 bit / s. If the condition is not met, then the optimal values of the bandwidth of the communication channels are found. Otherwise, D2 – D3 are repeated until the condition in D4 is met.

Stage 2. Sets of values of the bandwidth of communication channels of an unbalanced transport network are determined, taking into account all possible combinations of allowable network delays for protocol data units of only two priorities, then only for three priorities, and so on until all combinations of allowable network delays for protocol data units are considered all priorities.

As an example, let us explain a generalized algorithm that implements stage 2, which includes four steps.

D1. A vector is formed, the elements of which are all possible combinations of active restrictions.

D 2. The next option from the active constraints is selected from the generated vector.

D3. Using the next option for active constraints and the results of the solution obtained at the 1st stage form the sets of values of the bandwidth of the communication channels of the unbalanced transport network, using the mathematical apparatus of the matrix calculus

, (5)

, (five)

– очередной вариант активных ограничений;

– множество значения пропускных способностей каналов связи разбалансированной транспортной сети, полученные на 1-ом этапе.Where

- another version of active restrictions;

- a set of values of the capacity of communication channels of an unbalanced transport network, obtained at the 1st stage.

D4. Check the condition that all options from active constraints have been investigated. If the condition is met, then the set of values of the bandwidth of the communication channels of the unbalanced transport network is found. Otherwise, repeat actions D1 – D3.

Stage 3. A set of alternative solutions to the parametric optimization problem is determined; for this, the maximum values of the bandwidth of the communication channels of the unbalanced transport network are selected using the sets of bandwidth values that were determined at the second stage.

Stage 4. An optimal solution is selected from the set of solutions obtained at the third stage, which ensures: the fulfillment of the requirements for admissible network delays for protocol data units of all priorities and the minimum total costs associated with the lease of communication channels of the corresponding bandwidth.

As an example, let us explain stage 4, which includes seven steps.

D1. Choose from a variety of alternative solutions of the parametric optimization problem, the next solution, which should be checked for optimality.

-го приоритета.D 2. The next decision is checked for the absence of negative values of the network delay of the 1st priority PDU in each communication channel, then the 2nd priority PDU is checked, and so on up to the PDU

-th priority.

-го приоритета.D3. The next decision is checked for the absence of negative values of the network delay of the 1st priority PDU in the unbalanced transport communication network, then the 2nd priority PDU is checked, and so on up to the PDU

-th priority.

-го приоритета.D4. The next decision is checked for the fact that the network delay of the 1st PDU in the unbalanced transport communication network satisfies the constraint introduced for the PDU of the 1st priority, then that the network delay for the 2nd PDU satisfies the constraint introduced for the PDU 2- 1st priority and so on up to PBD

-th priority.

E5. The next decision is checked for the fact that the total costs associated with the lease of communication channels for the analyzed combination of active restrictions is less than the total costs associated with the lease of communication channels for the optimal combination of active restrictions.

D6. Check the fact that for the next solution of the parametric optimization problem, conditions D2-D5 are simultaneously satisfied. If all conditions are met, then the next solution becomes the optimal solution. If at least one condition from D2-D5 is not met, then the optimal solution remains unchanged.

D 7. Check the condition that all alternative solutions of the parametric optimization problem have been investigated. If the condition is met, then the optimal solution has been found. Otherwise, actions D1-D6 are repeated until the condition in D7 is met.

107. Tables of switching / routing, topology and resource management of the unbalanced transport communication network are formed in matrix form.

Switching / routing tables of an unbalanced transport communication network are formed using connected structures found by the criterion of the maximum availability factor for the corresponding connected structure. The unbalanced transport communication network topology tables are populated using the calculated optimal logical structure of the unbalanced transport communication network. The resource control tables are filled using the found optimal values of the bandwidth of the communication channels of the unbalanced transport communication network.

108. Converting the tables of switching / routing, topology and resource management of the unbalanced transport communication network from a matrix form to a scalar form.

109. Transfer to the network elements of the unbalanced transport communication network switching / routing tables, topology and resource management.

-го приоритета, допустимых сетевых задержек для протокольных блоков данных 1-го, 2-го и так далее вплоть до

-го приоритета, информации о сетевых элементах разбалансированной транспортной сети связи из скалярного вида в матричный вид, нахождения оптьимальных значений пропускных способностей каналов связи разбалансированной транспортной сети связи, с использованием информации от сети доступа, как минимум среднего размера протокольных блоков данных и интенсивности поступления протокольных блоков данных 1-го, 2-го и

-го приоритетов, допустимых сетевых задержек для протокольных блоков данных 1-го, 2-го и

-го приоритетов, с использованием математического аппарата матричного исчисления и обобщенного метода неопределенных множителей Лагранжа.The claimed method for optimizing the communication network allows to achieve the specified technical result by converting the information received from the network of the communication operator, at least the average delay time and readiness coefficients of communication channels, information from the access network, at least the average size of the protocol data blocks and the rate of receipt of the protocol data blocks 1st, 2nd and so on up to

-th priority, acceptable network delays for PDUs 1, 2, and so on up to

-th priority, information about network elements of an unbalanced transport communication network from scalar form to matrix form, finding the optimal values of the bandwidth of communication channels of an unbalanced transport communication network, using information from the access network, at least the average size of protocol data blocks and the intensity of receipt of protocol blocks data of 1st, 2nd and

-th priorities, admissible network delays for protocol data units 1, 2 and

-th priorities, using the mathematical apparatus of matrix calculus and the generalized method of indefinite Lagrange multipliers.

A device for optimizing an unbalanced transport communication network (Fig. 2) consists of a routing module 201, a topology synthesis module 202, a network resource management module 203, a data conversion module 204, a data module 205, a matrix operations module 206, a network resource management module 207, a module collection / output of parameters 208, while all the modules in the device are connected through a common internal bus AXI4, which acts as a means of information exchange between the modules.

The routing module 201 is configured to find the communication structures of the unbalanced transport communication network according to the criterion of the minimum average delay time for the corresponding communication structure and according to the criterion of the maximum availability for the corresponding communication structures.

Topology synthesis module 202, configured to calculate the optimal logical structure of an unbalanced transport communication network using information from the operator's network, at least the average delay time and availability factors of communication channels, information about network elements of an unbalanced transport communication network, information about the found communication structures according to the criterion of the minimum average delay time for the corresponding connected structures.

-го приоритета, допустимых сетевых задержек для протокольных блоков данных 1-го, 2-го и так далее вплоть до

-го приоритета, с использованием математического аппарата матричного исчисления и обобщенного метода неопределенных множителей Лагранжа.The network resource management module 203, configured to find the optimal values of the bandwidth of the communication channels of the unbalanced transport communication network, using information from the access network, at least the average size of the protocol data blocks and the intensity of the arrival of the protocol data blocks of the 1st, 2nd and so on further up to

-th priority, acceptable network delays for PDUs 1, 2, and so on up to

-th priority, using the mathematical apparatus of the matrix calculus and the generalized method of indefinite Lagrange multipliers.

-го приоритета, допустимых сетевых задержек для протокольных блоков данных 1-го, 2-го и так далее вплоть до

-го приоритета, информации о сетевых элементах транспортной сети связи из скалярного вида в матричный вид, а также таблиц коммутации/маршрутизации, топологии и управления ресурсом разбалансированной транспортной сети связи из матричного вида в скалярный.Data conversion module 204, configured to convert the information received from the operator's network, at least the average delay time and readiness factors of communication channels, information from the access network, at least the average size of protocol data blocks and the rate of arrival of protocol data blocks 1, 2 th and so on up to

-th priority, acceptable network delays for PDUs 1, 2, and so on up to

-th priority, information about the network elements of the transport communication network from scalar form to matrix form, as well as switching / routing tables, topology and resource management of an unbalanced transport communication network from matrix form to scalar form.

Data module 205, configured to fill in the switching / routing tables, topology and resource management of the unbalanced transport communication network in matrix form and transfer the table data to the parameter acquisition / output module.

Module of matrix operations 206, designed to implement the mathematical apparatus of matrix calculus.

Administrative control module 207, configured to control and configure the device, output information to the service information monitor.

-го приоритета, допустимых сетевых задержек для протокольных блоков данных 1-го, 2-го и так далее вплоть до

-го приоритета, информации о сетевых элементах разбалансированной транспортной сети связи, передачи сетевым элементам таблиц коммутации/маршрутизации, топологии и управления ресурсом разбалансированной транспортной сети связи в скалярном виде.The module for collecting / outputting parameters 208, configured to receive information from the operator's network, at least the average delay time and availability of communication channels, information from the access network, at least the average size of the protocol data blocks and the intensity of the arrival of the 1st protocol data blocks, 2nd and so on up to

-th priority, acceptable network delays for PDUs 1, 2, and so on up to

-th priority, information about network elements of an unbalanced transport communication network, transferring switching / routing tables, topology and resource management of an unbalanced transport communication network to network elements in scalar form.

Modules 201-208 can be implemented according to a well-known scheme, for example, on the NEC PF6800 Programmble Flow controller platform (http://www.sdxcentral.com/products/nec-programmbleflow controller).

All modules in the device for optimizing an unbalanced transport communication network are connected via a common internal bus AXI4, which acts as a means of information exchange between the modules.

The device works as follows.

-го приоритета, допустимые сетевые задержки для протокольных блоков данных 1-го, 2-го и так далее вплоть до

-го приоритета, информация о сетевых элементах разбалансированной транспортной сети связи. Вся поступившая информация передается в модуль преобразования данных 204, в котором преобразуется из скалярного вида в матричный вид. Информация от сети оператора связи, как минимум среднее время задержки и коэффициенты готовностей каналов связи, а также информация о сетевых элементах разбалансированной транспортной сети связи поступает в модуль маршрутизации 201. В данном модуле находят связные структуры разбалансированной транспортной сети связи такие, как кратчайшие маршруты, остовые деревья, гамильтоновы цепи и циклы по критерию минимума среднего времени задержки для соответствующих связных структур. Найденные связные структуры разбалансированной транспортной сети связи передаются в модуль синтеза топологии 202. В модуль синтеза топологии 202 также поступает информация с модуля преобразования данных 204, как минимум среднее время задержки и коэффициенты готовностей каналов связи. В модуле синтеза топологии 202 вычисляют оптимальную логическую структуру разбалансированной транспортной сети связи. Оптимальная логическая структура разбалансированной транспортной сети связи передается в модуль маршрутизации 201 для нахождения связных структур по критерию максимума коэффициента готовности для соответствующих связных структур. Данные связные структуры, найденные по критерию максимума коэффициента готовности для соответствующих связных структур, передаются в модуль данных 205 для заполнения таблиц коммутации/маршрутизации разбалансированной транспортной сети связи. Оптимальная логическая структура разбалансированной транспортной сети связи передается в модуль данных 205 для заполнения таблиц топологии разбалансированной транспортной сети связи, а также в модуль управления сетевыми ресурсами 203. В модуль управления сетевыми ресурсами 203 поступает информация от сети доступа, как минимум средний размер протокольных блоков данных и интенсивности поступления протокольных блоков данных 1-го, 2-го и так далее вплоть до

-го приоритета, допустимые сетевые задержки для протокольных блоков данных 1-го, 2-го и так далее вплоть до

-го приоритета. На основе всех входящих данных в модуле управления сетевыми ресурсами 203, используя обобщенный метод неопределенных множителей Лагранжа, находят оптимальные значения пропускных способностей каналов связи разбалансированной транспортной сети связи, при этом все матричные исчисления реализуются в модуле матричных операций 206. Далее оптимальные значения пропускных способностей каналов связи разбалансированной транспортной сети связи передают в модуль данных 205 для заполнения таблиц управления ресурсом разбалансированной транспортной сети связи. Из модуля данных 205 заполненные таблицы коммутации/маршрутизации, топологии и управления ресурсом поступают в модуль преобразования данных 204, где эти таблицы преобразуют из матричного вида в скалярный вид и передают в модуль сбора/вывода параметров 208. The module for collecting / outputting parameters 208 receives information from the operator's network, at least the average delay time and readiness coefficients of communication channels, information from the access network, at least the average size of protocol data blocks and the intensity of receipt of protocol data blocks 1, 2 and so on up to

-th priority, allowable network delays for PDUs 1, 2, and so on up to

-th priority, information about network elements of an unbalanced transport communication network. All received information is transmitted to the data conversion module 204, in which it is converted from scalar form to matrix form. Information from the operator's network, at least the average latency and availability factors of communication channels, as well as information about the network elements of the unbalanced transport communication network, is sent to the routing module 201. In this module, the connected structures of the unbalanced transport communication network are found, such as the shortest routes, backbones trees, Hamiltonian chains, and cycles by the criterion of the minimum average delay time for the corresponding connected structures. The found connected structures of the unbalanced transport communication network are transmitted to the topology synthesis module 202. The topology synthesis module 202 also receives information from the data conversion module 204, at least the average delay time and the availability factors of the communication channels. In the topology synthesis module 202, an optimal logical structure of the unbalanced transport communication network is calculated. The optimal logical structure of the unbalanced transport communication network is transmitted to the routing module 201 to find the connected structures according to the criterion of the maximum availability factor for the corresponding connected structures. These connective structures, found by the criterion of the maximum availability factor for the corresponding connective structures, are transmitted to the data unit 205 to populate the switching / routing tables of the unbalanced transport communication network. The optimal logical structure of the unbalanced transport communication network is transmitted to the data module 205 for filling the tables of the topology of the unbalanced transport communication network, as well as to the network resource management module 203. The network resource management module 203 receives information from the access network, at least the average size of the protocol data blocks and the intensity of the arrival of protocol data blocks 1, 2, and so on up to

-th priority, allowable network delays for PDUs 1, 2, and so on up to

-th priority. On the basis of all the input data in the network resource management module 203, using the generalized method of indefinite Lagrange multipliers, the optimal values of the communication channel capacities of the unbalanced transport communication network are found, while all matrix calculations are implemented in the matrix operations module 206. Further, the optimal values of the communication channel capacities the unbalanced transport network is transmitted to the data unit 205 for populating the resource management tables of the unbalanced transport communication network. From the data module 205, the completed switching / routing, topology and resource management tables are sent to the data conversion module 204, where these tables are converted from matrix form to scalar form and transmitted to the parameter acquisition / output module 208.

-го приоритета.Thanks to a new set of essential features, the specified technical result is achieved due to the additionally introduced module of matrix operations, a module for managing network resources, a data conversion module, which makes it possible to reduce the number of arithmetic operations when finding the optimal values of the bandwidth of communication channels of an unbalanced transport network and to find the optimal values of the bandwidth of channels communication in an unbalanced transport communication network, while fulfilling the requirements for the permissible network delay for protocol data blocks of both the 1st and 2nd, and so on up to

-th priority.

The system for optimizing an unbalanced transport communication network (Fig. 3) contains a device for optimizing an unbalanced transport communication network, at least five network elements configured to fill the switching / routing tables, topology and resource management of the unbalanced transport communication network, each network element being connected with a device for optimizing an unbalanced transport communication network by a control channel or a logical control channel, network elements are connected to each other by communication channels.

A device for optimizing an unbalanced transport communication network is made according to claim 2 of the claims of the present invention.

Switches or routers that support the open protocols OpenFlow or SSH can be used as network elements.

Any network element can be implemented according to a known scheme, for example, as described in patent RU No. 2584471 dated 20.05.2016, or in the form of a Programmble Flow PF5340-48XP-6Q switch (see www.nstor.ru/ru/news/lenta /nec_pf5340_48xp_6q_32qp.html).

An unbalanced transport optimization device communicates with network elements using, for example, OpenFlow or SSH.

The interactive process of the system functioning to optimize the unbalanced transport communication network is described below.

The network elements of an unbalanced transport communication network transmit information about enabled / disabled physical ports to the device to optimize the unbalanced transport communication network.

In a device for optimizing an unbalanced transport communication network:

-го приоритета, допустимые сетевые задержки для протокольных блоков данных 1-го, 2-го и так далее вплоть до

-го приоритета, информацию от всех сетевых элементов разбалансированной транспортной сети связи о включённых/выключенных физических портах.1. The module for collecting / outputting parameters receives information from the operator's network, at least the average delay time and readiness coefficients of communication channels, information from the access network, at least the average size of the protocol data blocks and the rate of receipt of the protocol data blocks of the 1st, 2nd and so on up to

-th priority, allowable network delays for PDUs 1, 2, and so on up to

-th priority, information from all network elements of an unbalanced transport communication network about enabled / disabled physical ports.

-го приоритета, допустимые сетевые задержки для протокольных блоков данных 1-го, 2-го и так далее вплоть до

-го приоритета, информацию о сетевых элементах разбалансированной транспортной сети связи из скалярного вида в матричный вид.2. The data conversion module converts the information received from the operator's network, at least the average delay time and readiness coefficients of communication channels, information from the access network, at least the average size of the protocol data blocks and the intensity of the arrival of the protocol data blocks 1, 2 and so on up to

-th priority, allowable network delays for PDUs 1, 2, and so on up to

-th priority, information on network elements of an unbalanced transport communication network from scalar to matrix form.

3. The routing module finds the connected structures of the unbalanced transport communication network, such as shortest routes, spanning trees, Hamiltonian chains and cycles according to the criterion of the minimum average delay time for the corresponding connected structures, the found connected structures are transferred to the topology synthesis module.

4. The topology synthesis module calculates the optimal logical structure of an unbalanced transport communication network using information from the operator's network, at least the average delay time and availability factors of communication channels, information about network elements of an unbalanced transport communication network, information about the found communication structures according to the minimum criterion the average delay time for the corresponding connected structures. The optimal logical structure of the unbalanced transport communication network is transmitted to the routing module, to the network resource management module of the unbalanced transport communication network and to the data module (in this module, the topology tables of the unbalanced transport communication network are filled in).

5. The routing module finds connected structures of an unbalanced transport communication network, such as shortest routes, spanning trees, Hamiltonian chains and cycles based on the criterion of the maximum availability factor for the corresponding connected structures. The found connected structures are transmitted to the data module for filling in the switching / routing tables of the unbalanced transport communication network and to the network resource management module of the unbalanced transport communication network.

-го приоритета, допустимые сетевые задержки для протокольных блоков данных 1-го, 2-го и так далее вплоть до

-го приоритета, информация о связных структурах, найденных по критерию максимума коэффициента готовности для соответствующих связных структур, информация об оптимальной логической структуре разбалансированной транспортной сети связи. На основе полученных данных в модуле управления сетевыми ресурсами разбалансированной транспортной сети связи, используя обобщенный метод неопределенных множителей Лагранжа, находят оптимальные значения пропускных способностей каналов связи разбалансированной транспортной сети связи, при этом все матричные исчисления реализуются в модуле матричных исчислений. Далее передают оптимальные значения пропускных способностей каналов связи разбалансированной транспортной сети связи в модуль данных для заполнения таблиц управления ресурсом.6. The network resource management module of the unbalanced transport communication network receives information from the access network, at least the average size of the protocol data blocks, the intensity of the arrival of the 1st, 2nd protocol data blocks, and so on up to

-th priority, allowable network delays for PDUs 1, 2, and so on up to

-th priority, information about the connected structures found by the criterion of the maximum availability factor for the corresponding connected structures, information about the optimal logical structure of an unbalanced transport communication network. On the basis of the data obtained in the network resource management module of the unbalanced transport communication network, using the generalized method of indefinite Lagrange multipliers, the optimal values of the communication channel capacities of the unbalanced transport communication network are found, while all matrix calculus are implemented in the matrix calculus module. Next, the optimal values of the bandwidths of the communication channels of the unbalanced transport communication network are transmitted to the data module to fill in the resource management tables.

7. The data module receives information about the connected structures found according to the criterion of the maximum availability factor for the corresponding connected structures, and fills in the switching tables. Receives information about the optimal logical structure of an unbalanced transport communication network and fills in the topology tables. Receives information about the optimal values of the bandwidth of the communication channels of the unbalanced transport communication network and fills in the resource management tables. All tables are filled in matrix form and transferred to the data conversion module.

8. The data conversion module converts the received tables of switching / routing, topology and resource management of the unbalanced transport communication network from matrix form to scalar form and then transmits the switching / routing, topology and resource management tables to the module for collecting / outputting parameters.

9. The module for collecting / outputting parameters transmits the tables of switching / routing, topology and resource management to the network elements of the unbalanced transport communication network.

The network elements of an unbalanced transport communication network adopt switching / routing, topology and resource management tables. Based on these tables, network elements populate their switching / routing, topology, and resource management tables. Physical ports are managed based on the completed switch / routing tables, topology, and resource management.

-го приоритета.Thanks to a new set of essential features, the specified technical result is achieved through the use of a system for optimizing an unbalanced transport network, which contains a device for optimizing an unbalanced transport network, at least five network elements made with the ability to fill in the switching / routing tables, topology and resource management of an unbalanced transport network communication, each network element is connected to a device for optimizing an unbalanced transport communication network by a control channel or a logical control channel, the network elements are connected to each other by communication channels, which makes it possible to reduce the number of arithmetic operations when finding the optimal values of the capacity of communication channels of an unbalanced transport network and to find optimal values of the bandwidth of communication channels in an unbalanced transport communication network, while fulfilling the requirements for the permissible network back delays for PDUs 1 and 2, and so on up to

-th priority.

The validity of the theoretical premises was tested on a fragment of an unbalanced transport communication network (Fig. 4) using the OMNet ++ network simulator with the following initial data:

; - number of network nodes

;

- the number of information directions is 8, and in each information direction protocol data blocks of the 1st, 2nd and 3rd priorities are transmitted;

- the rates of arrival of protocol data blocks in different information directions are presented in Tables 1–2;

- the value of the admissible network delay for the 1st priority PDU is 0.13 (s), for the 2nd priority PDU is 0.2 (s), for the 3rd priority PDU is 0.3 ( from).

бит.- average size of protocol data blocks

bit.

Table 1 - Intensity of receipt of protocol data units in information directions (beginning)

Characteristic

,

,

,

,

,

, PBB / s 23 five 17 8

, PBB / s 12 thirty 28 21

, PBB / s 17 28 nine 12

, PBB / s 52 63 54 41

Table 2 - Intensity of receipt of protocol data units in information directions (end)

Characteristic

,

,

,

,

,

, PBB / s 4 23 26 17

, PBB / s nineteen eleven sixteen 2

, PBB / s 17 28 nine 26

, PBB / s 40 62 51 45

Table 3 - Results obtained using the method of optimization of an unbalanced transport communication network

характеризуется тем, что выполняются все условия по допустимой сетевой задержке для протокольных блоков данных всех приоритетов, при этом затраты на аренду каналов связи соответствующей пропускной способности являются минимальными. Стоит отметить, что следующие комбинации из активных ограничений

,

,

соответствуют результатам, которые получаются на этапе параметрической оптимизации в прототипе системы. Как видно, в прототип системы не позволяет найти оптимальные значения пропускных способностей каналов связи разбалансированной транспортной сети при этом выполнив требования по допустимой сетевой задержке для протокольных блоков данных всех приоритетов. Analysis of the results of the parametric optimization stage (Table 3) shows that the combination

characterized by the fact that all the conditions for the permissible network delay for protocol data units of all priorities are met, while the cost of leasing communication channels of the corresponding bandwidth is minimal. It should be noted that the following combinations of active restrictions

,

,

correspond to the results that are obtained at the stage of parametric optimization in the prototype of the system. As you can see, the prototype of the system does not allow finding the optimal values of the bandwidth of communication channels of an unbalanced transport network while fulfilling the requirements for the permissible network delay for protocol data units of all priorities.

To prove the technical result associated with a decrease in the number of arithmetic operations when finding the optimal values of the bandwidth of communication channels of an unbalanced transport network, let us consider analytical expressions that solve the problem of parametric optimization in the claimed invention and in the prototype.

-го приоритета используется математический аппарат скалярных исчислений In the prototype method for finding the optimal values of the bandwidth of communication channels, taking into account the permissible network delay for protocol data blocks

-th priority, the mathematical apparatus of scalar calculus is used

(6)

(6)

– средний размер ПБД для ЛК или КС с номером

,

– средний размер ПБД для ЛК или КС с номером

,

– стоимость аренды в расчете на единицу пропускной способности ЛК или КС с номером

,

– стоимость аренды в расчете на единицу пропускной способности ЛК или КС с номером

,

– допустимое значение математического ожидания задержки ПБД

-го приоритета для транспортной сети связи,

– это сумма интенсивностей потоков ПБД

-го приоритета для транспортной сети связи,

– интенсивность потока ПБД

-го приоритета для ЛК или КС с номером

,

– интенсивность потока ПБД

-го приоритета для ЛК или КС с номером

,

– задержка распространения ПБД для ЛК или КС с номером

,

– число сетевых элементов (СЭ) для транспортной сети связи;

– общее число СЭ, ЛК или КС для транспортной сети связи. Where

- average size of PBB for LC or CS with number

,

- average size of PBB for LC or CS with number

,

- the cost of rent per unit of bandwidth of a LC or CS with a number

,

- the cost of rent per unit of bandwidth of a LC or CS with a number

,

Is the admissible value of the mathematical expectation of the PDU delay

-th priority for the transport communication network,

Is the sum of the PBB flow rates

-th priority for the transport communication network,

- PBB flow rate

-th priority for LC or COP with number

,

- PBB flow rate

-th priority for LC or COP with number

,

- delay of PBB propagation for LC or CS with number

,

- the number of network elements (NE) for the transport communication network;

- the total number of SE, LC or CS for the transport communication network.

, где z – число каналов связи, k – количество приоритетов. То есть количество арифметических операций необходимых для нахождения оптимальных значений пропускных способностей каналов связи транспортной сети связи, представленной на фиг. 4, равно 768.The number of arithmetic operations required to find the optimal values of the bandwidth of communication channels is determined by the following expression

, where z is the number of communication channels, k is the number of priorities. That is, the number of arithmetic operations required to find the optimal values of the bandwidth of the communication channels of the transport communication network shown in FIG. 4 is equal to 768.

-го приоритета используется математический аппарат матричных исчислений выражение (3).In the invention, to find the optimal values of the bandwidth of communication channels, taking into account the permissible network delay for protocol data units

-th priority is used the mathematical apparatus of matrix calculus expression (3).

. То есть количество арифметических операций необходимых для нахождения оптимальных значений пропускных способностей каналов связи транспортной сети связи, представленной на фиг. 4, равно 61. Таким образом, в прототипе требуется более чем в 12 раз больше арифметических операций на этапе нахождения оптимальных значений пропускных способностей каналов связи разбалансированной транспортной сети связи, чем в заявленном изобретении.The number of arithmetic operations required to find the optimal values of the bandwidth of communication channels is determined by the following expression

... That is, the number of arithmetic operations required to find the optimal values of the bandwidth of the communication channels of the transport communication network shown in FIG. 4 is equal to 61. Thus, the prototype requires more than 12 times more arithmetic operations at the stage of finding the optimal values of the bandwidth of the communication channels of the unbalanced transport communication network than in the claimed invention.

-го приоритета, допустимых сетевых задержек для протокольных блоков данных 1-го, 2-го и так далее вплоть до

-го приоритета, информации о сетевых элементах разбалансированной транспортной сети связи из скалярного вида в матричный вид и обратно (в модуле преобразования данных), нахождения оптимальных значений пропускных способностей каналов связи разбалансированной транспортной сети с использованием математического аппарата матричного исчисления и обобщенного метода неопределенных множителей Лагранжа, в модуле управления сетевыми ресурсами разбалансированной транспортной сети, достигается уменьшение числа арифметических операций более чем в 12 раз при нахождении оптимальных значений пропускных способностей каналов связи разбалансированной транспортной сети. Также анализ результатов параметрической оптимизации показывает, что за счет использования системы для оптимизации разбалансированной транспортной сети связи, которая содержит устройство для оптимизации разбалансированной транспортной сети связи, как минимум пять сетевых элементов, выполненных с возможностью заполнения таблиц коммутации/маршрутизации, топологии и управления ресурсом разбалансированной транспортной сети связи, причем каждый сетевой элемент соединен с устройством для оптимизации разбалансированной транспортной сети связи каналом управления или логическим каналом управления, сетевые элементы соединены друг с другом каналами связи достигается указанный технический результат.The analysis of the results of the parametric optimization procedure shows that, due to the transformation of the information received from the operator's network, at least the average delay time and availability factors of communication channels, information from the access network, at least the average size of protocol data blocks and the intensity of receipt of protocol data blocks of the 1st , 2nd and so on up to

-th priority, acceptable network delays for PDUs 1, 2, and so on up to

-th priority, information about network elements of an unbalanced transport communication network from scalar form to matrix form and vice versa (in the data conversion module), finding the optimal values of the bandwidth of communication channels of an unbalanced transport network using the mathematical apparatus of the matrix calculus and the generalized method of indefinite Lagrange multipliers, in the module for managing network resources of an unbalanced transport network, a decrease in the number of arithmetic operations is achieved by more than 12 times while finding the optimal values of the bandwidth of communication channels of an unbalanced transport network. Also, the analysis of the results of parametric optimization shows that due to the use of a system for optimizing an unbalanced transport communication network, which contains a device for optimizing an unbalanced transport communication network, at least five network elements made with the ability to fill in the switching / routing tables, topology and resource management of the unbalanced transport communication network. communication networks, each network element is connected to a device for optimizing an unbalanced transport communication network by a control channel or a logical control channel, the network elements are connected to each other by communication channels, the specified technical result is achieved.

Claims (8)

1. A device for optimizing an unbalanced transport communication network, containing a module for collecting / outputting parameters, configured to receive information from the operator's network, at least the average delay time and availability of communication channels, information from the access network, at least the average size of the protocol data blocks and the arrival rate of protocol data blocks 1, 2, and so on up to

-th priority, acceptable network delays for PDUs 1, 2, and so on up to

-th priority, information about network elements of an unbalanced transport communication network, transferring to network elements of switching / routing tables, topology and resource management, a routing module configured to find communication structures of an unbalanced transport communication network according to the criterion of a minimum average delay time for the corresponding communication structure and according to the criterion of the maximum availability factor for the corresponding connected structures, the topology synthesis module, made with the ability to calculate the optimal logical structure of an unbalanced transport communication network, using information from the operator's network, at least the average delay time and availability factors of communication channels, information about network elements unbalanced transport communication network, information about the found connected structures according to the criterion of the minimum average delay time for the corresponding connected structures, a data module made with the ability to fill of switching / routing tables, topology and resource management of an unbalanced transport communication network and transferring table data to the parameter collection / output module, an administrative control module capable of controlling and configuring the device, displaying information on the service information monitor, characterized in that it additionally includes a module of matrix operations designed to implement the mathematical apparatus of matrix calculus, a network resource control module designed to find the optimal values of the bandwidth of communication channels of an unbalanced transport communication network, using information from the access network, at least the average size of protocol data blocks and the intensity of receipt protocol data blocks 1, 2 and so on up to

-th priority, acceptable network delays for PDUs 1, 2, and so on up to

-th priority, using the generalized method of indefinite Lagrange multipliers, a data conversion module capable of converting the information received from the operator's network, at least the average delay time and availability factors of communication channels, information from the access network, at least the average size of the protocol data blocks and the arrival rate of protocol data blocks 1, 2, and so on up to

-th priority, acceptable network delays for PDUs 1, 2, and so on up to

-th priority, information about network elements of an unbalanced transport communication network from scalar form to matrix form, as well as switching / routing tables, topology and resource management of an unbalanced transport communication network from matrix form to scalar form, while all modules in the device are connected through a common internal bus AXI4, which acts as a means of information exchange between modules. 2. A method for optimizing an unbalanced transport communication network, carried out by the device according to claim 1, consisting in the fact that they receive information from the operator's network, at least, the average delay time and availability factors of communication channels, information from the access network, at least average size protocol data blocks and the arrival rate of protocol data blocks 1, 2, and so on up to

-th priority, allowable network delays for PDUs 1, 2, and so on up to

-th priority, information about the network elements of the unbalanced transport communication network, determine the connected structures for the unbalanced transport communication network according to the criterion of the minimum average delay time for the corresponding connected structure, calculate the optimal logical structure of the unbalanced transport communication network, using information from the operator's network, as minimum average delay time and availability factors of communication channels, information about network elements of an unbalanced transport communication network, information about the found connected structures according to the criterion of minimum average delay time for the corresponding connected structures, find connected structures on the optimal logical structure of an unbalanced transport communication network according to the maximum criterion availability factor for the corresponding connected structures, form the switching / routing tables, topology and resource management of the unbalanced transport communication network in a matrix form e, transfer to the network elements of the unbalanced transport communication network switching / routing tables, topology and resource management, characterized in that they convert the information received from the operator's network, at least, the average delay time and availability factors of communication channels, information from the access network, at least , the average size of the protocol data blocks and the intensity of the arrival of the 1st, 2nd and so on protocol data blocks up to

-th priority, allowable network delays for PDUs 1, 2, and so on up to

-th priority, information about the network elements of the unbalanced transport communication network from scalar form to matrix form, and after forming the switching / routing, topology and resource management tables, transform the table data into scalar form, find the optimal values of the bandwidth of the unbalanced transport communication channels network, using information from the access network, at least the average size of the protocol data blocks and the intensity of the arrival of the protocol data blocks 1, 2, and so on up to

-th priority, acceptable network delays for PDUs 1, 2, and so on up to

-th priority, using the mathematical apparatus of the matrix calculus and the generalized method of indefinite Lagrange multipliers. 3. The method according to claim 2, according to which at least the following steps are carried out when finding the optimal values of the bandwidth of the communication channels of an unbalanced transport network: at the first stage, the optimal values of the bandwidth of the communication channels of the unbalanced transport network are determined, taking into account the admissible network delay only for the protocol data units of the 1st priority, then only for the 2nd priority, and so on up to

-th priority; at the second stage, sets of values of the bandwidth of communication channels of an unbalanced transport network are determined, taking into account all possible combinations of allowable network delays for protocol data units of only two priorities, then only for three priorities, and so on until all combinations of allowable network delays for protocol data units of all priorities; at the third stage, a set of alternative solutions of the parametric optimization problem is determined, for this, the maximum values of the bandwidth of the communication channels of the unbalanced transport communication network are selected using the sets of bandwidth values that were determined at the second stage; at the fourth stage, from the set of solutions obtained at the third stage, an optimal solution is selected that provides: fulfillment of the requirements for admissible network delays for protocol data units of all priorities and the minimum total costs associated with leasing communication channels of the corresponding bandwidth. 4. The system for optimizing an unbalanced transport communication network contains at least five network elements configured to fill in the switching / routing tables, topology and resource management of an unbalanced transport communication network, and each network element is connected to a device for optimizing an unbalanced transport communication network by a channel control or a logical control channel, the network elements are connected to each other by communication channels, and the device for optimizing an unbalanced transport communication network is made according to claim 1.

Images