RU2684571C1 - Method and system for optimization hierarchical multilevel transport communication network - Google Patents

Abstract

FIELD: communication equipment.

SUBSTANCE: invention relates to telecommunication networks, in particular, to optimization of transport network with packet switching. Technical result is achieved, in particular, due to connection of each subnetwork controller of hierarchical multilevel transport communication network with physical / logical control channels with at least network elements of two adjacent in hierarchy subnetworks hierarchical multilevel transport network.

EFFECT: reduced complexity and number of operations for optimization of a hierarchical multi-level transport communication network, as well as higher reliability of control level of a hierarchical multilevel transport communication network.

7 cl, 4 dwg

Description

Technical field

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

State of the art

Currently, there is an acute problem of congestion in communication networks based on traditional technologies. Given the fact that by 2020 more than 50 billion Internet of Things and Industrial Internet devices will be connected to public networks, there is a risk that the networks will not cope with the traffic generated by so many nodes. In addition, there will be difficulty in managing and configuring networks of this magnitude.

The well-known "Method of congestion control and resource allocation in networks with architecture separation on subnets" (patent US 8730806 B2 dated 05/20/2014), including a set of switches, a set of communication channels, a subnet control controller, while the switches are interconnected by a channel communication, and consisting of the steps: obtaining by the subnet controller statistics on data traffic, detecting an overloaded communication channel in the subnet, identifying routes that overload the communication channel, calculating the probability of redistributing data traffic n other routes based on the likelihood of redistribution of the data traffic, control the intensity of data traffic revenues.

The well-known "Method of traffic control between multiple interconnected sites" (patent US 20170012827 A1 dated 01/12/2017), which includes sites that are interconnected via ring elements and segments of a logical ring implemented by a network controller over a physical transport communication network, moreover The method comprises the steps of: obtaining traffic information in a logical ring, determining, in accordance with the received information, the need to change the ring topology, performing optimization in accordance with a specific need topology taking into account traffic changes, while optimizing the topology includes at least one of: increasing the capacity of the ring segment, reducing the capacity of the ring segment, creating a traffic route and deleting the existing traffic route, as well as transmitting updated routing information to the ring nodes routing information reflecting a change in ring topology.

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

за канал связи l; и маршрутизацию нового потока к промежуточному узлу k по маршруту с минимальным весом, когда у минимального маршрута вес, меньше или равный одному.The well-known "Method of calculating the route in real time and engineering the traffic of the routing segment" (patent US 20160294700 A1 from 09/06/2016), which includes the steps of: determining the set of communication channels with double variables

; obtaining a new data traffic stream, while determining an intermediate node k providing a minimum weight for two segment routes from the input node to the output node for a new stream based on a stream that ends on communication channel l from a new stream to intermediate node k and double weight rate

per communication channel l; and routing the new flow to intermediate node k along a route with a minimum weight when the minimum route has a weight less than or equal to one.

The closest in technical essence to the claimed method and selected as a prototype is the "Method for a transport software-configured network with traffic engineering using dual variables" (patent US 20170195230 A1 from 07/06/2017), which consists in the fact that they receive information about traffic in the transport communication network, determine the change or expected change in traffic in the transport communication network, identify one or more congested communication channels in the transport communication network by solving the optimization problem in order to maximize the efficiency of the network, taking into account changes or expected changes in traffic in the transport communication network, in which the solution to the optimization problem includes solving problems taking into account a set of restrictions on communication channels with two variables, adjust the throughput of one or more communication channels in order to reduce congestion of at least an overloaded communication channel, update the configuration of the transport communication network.

The closest in technical essence to the claimed system and selected as a prototype is “A system for a transport software-configured network with traffic engineering using dual variables” (patent US 20170195230 A1 dated 07/06/2017), which consists of a network controller software configured to control the traffic of the transport communication network, which identifies one or more congested communication channels in the transport network by solving the optimization problem for max imitating the effectiveness of the functioning of the network, taking into account changes or expected changes in traffic in the transport communication network, in which the solution of optimization problems includes solving problems taking into account a set of restrictions on communication channels with two variables. The transport communication network is built using OTN technology, IP / MPLS - TE.

The technical problem of these analogues and prototype is the high complexity and a large number of calculations when implementing optimization of a hierarchical multi-level transport communication network, as well as the low reliability of the control level of a hierarchical multi-level transport communication network. This is due to the fact that the algorithms that solve the optimization problem of the transport communication network for the most part have a polynomial or exponential estimate of computational complexity.

The creation of a method and system for optimizing a hierarchical multi-level transport communication network is aimed at solving this technical problem, which reduces the complexity and number of optimization calculations of a hierarchical multi-level transport communication network by decomposing the general optimization problem into structural and parametric optimization problems of a hierarchical multi-level transport communication network in separate subnets hierarchical multi-level transport communication network, increase the reliability of the control level hierarchical multilevel transport communication network by connecting each subnet controller of the hierarchical multilevel transport communication network with physical / logical control channels, at least with network elements of two hierarchically adjacent subnets of the hierarchical multilevel transport communication network.

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

By a hierarchically adjacent subnet of a hierarchical multilevel transport communication network, we mean an R subnet of a hierarchical multilevel transport communication network for R + 1 and R-1 subnets of a hierarchical multilevel transport communication network.

Disclosure of invention

In the claimed method, this technical problem is solved in that in a method for optimizing a hierarchical multilevel transport communication network, which consists in the fact that after dividing the hierarchical multilevel transport communication network into subnets of the hierarchical multilevel transport communication network, information is received on user service levels, information on traffic parameters from network elements of the corresponding subnet of the hierarchical multi-level transport communication network, such as the average block delay time d nnyh, availability factor of physical / logical communication channels, loading of physical / logical communication channels corresponding subnet hierarchical multilevel transport network. After filling in the switching, topology and resource management tables for the corresponding subnet of the hierarchical multi-level transport communication network, transfer to the network elements of the corresponding subnet of the hierarchical multi-level transport communication network the switching / routing tables, topology and resource management tables, further divide the hierarchical multi-level transport communication network into R subnets of the hierarchical multi-level transport communication network. Connected structures are found for the corresponding subnet of the hierarchical multilevel transport communication network by the criterion of the minimum average delay time of data blocks for the corresponding connected structure. The optimal logical structure is calculated for the corresponding subnet of the hierarchical multi-level transport communication network, using the average delay time of data blocks and the availability factors of physical / logical communication channels for the corresponding subnet of the hierarchical multi-level transport communication network, information about network elements of the corresponding subnet of the hierarchical multi-level transport communication network, information on found connected structures by the criterion of the minimum average delay time for corresponding connected structures of the corresponding subnet of the hierarchical multilevel transport communication network. Connected structures are found on the optimal logical structure of the corresponding subnet of the hierarchical multi-level transport communication network by the criterion of the maximum availability factor of physical / logical communication channels for the corresponding connected structures of the corresponding subnet of the hierarchical multi-level transport communication network. The optimal distribution of the bandwidth of the physical / logical communication channels of the corresponding subnet of the hierarchical multi-level transport communication network is calculated using information obtained from the adjacent hierarchy of the hierarchical multi-level transport communication network, at least the average size of data blocks and the intensity of receipt of data blocks, quality of service requirements . The commutation / routing, topology, and resource management tables are populated for the corresponding subnet of the hierarchical multi-level transport communication network. The optimization steps are repeated for the adjacent hierarchy top-level subnet of the hierarchical multi-level transport communication network until at least the following verification condition occurs: the corresponding subnet of the hierarchical multi-level transport communication network does not have the adjacent hierarchy top-level subnet of the hierarchical multi-level transport communication network.

According to one particular embodiment, when the topology is changed in at least one subnet of the hierarchical multi-level transport communication network, or if at least one overloaded physical / logical communication channel is detected in any subnet of the hierarchical multi-level transport communication network, the optimization steps are repeated starting from the corresponding subnet hierarchical multilevel transport communication network, while the underlying subnets of the hierarchical multilevel transport communication network remain unchanged I am.

According to one particular embodiment, an additional condition is that the optimization steps begin with a subnet of a hierarchical multi-level transport communication network, which does not have an adjacent lower hierarchy subnet of a hierarchical multi-level transport communication network, while information about the availability factors of physical / logical communication channels is specified by the operator hierarchical multilevel transport communication network.

A new set of essential features allows achieving the indicated technical result due to the decomposition of the general optimization problem into structural and parametric optimization problems of the hierarchical multilevel transport communication network in separate subnets of the hierarchical multilevel transport communication network.

In the claimed system, this technical problem is solved in that in a system for optimizing a hierarchical multi-level transport communication network containing, R subnets of a hierarchical multi-level transport communication network, designed to transmit data traffic from a sender node to a recipient node, R subnet controllers of a hierarchical multi-level transport communication network designed to manage and configure the respective subnets of a hierarchical multi-level transport communication network. The subnet controller of the hierarchical multilevel transport communication network includes: a module for receiving / transmitting control parameters for receiving information about data traffic from network elements, transmitting switching / routing tables, topology and resource management to network elements, a module for statistical analysis of traffic, designed to analyze the physical workload / logical communication channels and network delay of data blocks, a module for finding connected structures, configured to find connected structures under hierarchical multilevel transport communication network according to the criterion of minimum average data block delay time for the corresponding connected structure and according to the maximum availability factor criterion for the corresponding connected structures, a structural optimization module configured to calculate the optimal logical subnet structure of the hierarchical multilevel transport communication network using information about traffic parameters from network elements of the corresponding hierarchical subnet multilevel transport communication network, at least the average delay time of data blocks and availability factors of physical / logical communication channels, information about network elements of the corresponding subnet of a hierarchical multi-level transport communication network, information about found connected structures by the criterion of minimum average delay time for the corresponding connected structures, parametric module optimization, configured to calculate the optimal distribution of the bandwidth of the physical / logical channel in connection with a subnet of a hierarchical multi-level transport communication network, using information obtained from an adjacent hierarchy of the upper hierarchy of a multi-level transport communication network, at least the average size of data blocks and the intensity of receipt of data blocks, quality of service requirements, a data module designed to store a switching table / routing, topology and resource management, network events, user interface module designed to connect to the controller the corresponding subnet of the hierarchical multilevel transport communication network, and outputting information, an application program interface module that allows the subnet controller of the hierarchical multilevel transport communication network to interact with one or more subnets of the hierarchical multilevel transport communication network, for example, to check the status of the subnet of the hierarchical multilevel transport communication network, add / removal of new connected structures.

According to one particular embodiment, the subnet of the hierarchical multi-level transport communication network includes at least three network elements interconnected by physical / logical communication channels, while the total number of network elements of the subnets of the hierarchical multi-level transport communication network is equal to the number of network elements in the hierarchical multilevel transport communication network as a whole.

According to one particular embodiment, the subnet controller of the hierarchical multi-level transport communication network is connected by physical / logical control channels to at least network elements of the corresponding subnet of the hierarchical multi-level transport communication network and the adjacent lower / upper hierarchy subnets of the hierarchical multi-level transport communication network.

According to one particular embodiment, the network elements of a single subnet of a hierarchical multi-level transport communication network interact with network elements of hierarchically adjacent subnets of a hierarchical multi-level transport communication network using interface connections.

Thanks to a new set of essential features, by connecting each subnet controller of a hierarchical multi-level transport communication network with physical / logical control channels, at least with network elements of two hierarchically adjacent multi-level transport communication network subnets, this technical result is achieved.

Infrastructure Layer, a set of network elements and devices that provide packet switching and routing (see Open Networking Foundation, OpenFlow-enabled SDN and Network Functions Virtualization ONF Solution Brief February 17, 2014)

The Control Layer provides the functions of logically centralized system management and controls the network characteristics of routing through an open interface (see Open Networking Foundation, OpenFlow-enabled SDN and Network Functions Virtualization ONF Solution Brief February 17, 2014)

By an interface connection we mean a set of methods and rules of interaction between network elements of adjacent subnets of a hierarchical multilevel transport communication network.

The analysis of the prior art made it possible to establish that there are no analogues that are characterized by a set of features identical to all the features of the claimed system for a hierarchical multi-level transport communication network. Therefore, the claimed invention meets the condition of patentability "novelty."

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

To more clearly illustrate technical solutions according to embodiments of the present invention, a brief description of the accompanying drawings is given below.

In FIG. 1 is a diagram of a method for optimizing a hierarchical multi-level transport communications network;

in FIG. 2 - optimal logical structure of the subnet of a hierarchical multi-level transport communication network;

in FIG. 3 is a system diagram for optimizing a hierarchical multi-level transport communications network;

in FIG. 4 is a diagram of a subnet controller of a hierarchical multi-level transport communication network.

Below will be fully and clearly described technical solutions for embodiments of the present invention 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 a creative approach fall within the protection scope of the present invention.

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

101. A hierarchical multilevel transport communication network is divided into R subnets of a hierarchical multilevel transport communication network, wherein R varies in the range from 3 to 100. The number of network elements N in each subnet of the hierarchical multilevel transport communication network varies in the range from 3 to 30.

102. Receive information about user service levels, information about traffic parameters from network elements of each subnet of a hierarchical multi-level transport communication network, such as average delay time of data blocks, availability factors of physical / logical communication channels, loading of physical / logical communication channels of a hierarchical multi-level transport subnet communication network.

103. Connected structures are found for the corresponding subnet of the hierarchical multilevel transport communication network by the criterion of minimum average data block delay time for the corresponding connected structures.

104. The optimal logical structure for the corresponding subnet of the hierarchical multi-level transport communication network is calculated using the average delay time of the data blocks and the availability factors of physical / logical communication channels for the corresponding subnet of the hierarchical multi-level transport communication network, information about the network elements of the subnet of the hierarchical multi-level transport communication network, information on found connected structures by the criterion of the minimum average delay time for the corresponding their connected structures of the corresponding subnet of the hierarchical multilevel transport communication network.

As an example, we explain a generalized algorithm that implements the calculation of the optimal logical structure by the branch and bound method, which includes four actions.

104.1. A list of combinations is formed, which contains only one empty combination (the state when no resource is assigned to any element of the communication network). For this combination, in the unused resource, the most reliable and most unreliable resource is determined and the upper and lower bounds are calculated for the availability coefficient of the corresponding subnet of the hierarchical multi-level transport communication network.

104.2. From the list of combinations, the next combination is selected, on the basis of which new combinations are formed by considering all possible options for assigning the next element of the corresponding subnet of the hierarchical multilevel transport network to connect a particular resource from the list of resources, but taking into account the resource already used.

104.3. 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 are calculated for the availability coefficient of the corresponding subnet of the hierarchical multi-level transport communication network.

104.4. If there are not considered combinations in the combination list, then return to 104.2. If all combinations in the list are considered, then in the new list of combinations the largest value of the lower limit of the availability coefficient of the corresponding subnet of the hierarchical multilevel transport communication network is determined. After that, all values of the upper bounds of the availability coefficient of the corresponding subnet of the hierarchical multilevel transport communication network are compared with this value, and combinations whose values of the lower bounds are removed from the new list of combinations as not promising.

The calculation of the upper and lower boundaries of the availability coefficient of the corresponding subnet of the hierarchical multi-level transport communication network is carried out according to the method described in GOST R 55111-2008.

For clarity, in FIG. Figure 2 shows the optimal logical structures of the corresponding hierarchical multilevel transport communication network obtained using the shortest routes (Fig. 2a), spanning trees (Fig. 2b), Hamiltonian chains (Fig. 2c) and cycles (Fig. 2d), provided that the hierarchical multilevel transport communication network with the lease of a channel resource from two telecom operators, five communication channels from each operator Telecommunication channels from one telecom operator have dashed lines, and solid lines from the other telecom operator.

105. Connected structures are found on the optimal logical structure of the corresponding subnet of the hierarchical multi-level transport communication network by the criterion of the maximum availability factor of physical / logical communication channels for the corresponding connected structures of the corresponding subnet of the hierarchical multi-level transport communication network.

106. The optimal distribution of the bandwidth of the logical physical / logical communication channels of the corresponding subnet of the hierarchical multilevel transport communication network is calculated, using information obtained from the hierarchy of the hierarchical multilevel transport communication network received from the top hierarchy, at least the average size of the data blocks and the intensity of the data blocks, requirements for quality of service.

As an example, we explain a generalized algorithm that implements the calculation of the optimal distribution of the capacity of physical / logical communication channels of the corresponding subnet of a hierarchical multi-level transport communication network, which includes five actions.

по формуле106.1. Calculation of initial values of throughputs of physical communication channels (FCC) or throughputs of logical channels (LC)

according to the formula

, (one)

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

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

;Where

- DB flow rate

priority for LC or FCC with number

;

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

;

- the average size of the database for LC or FCC with a number

;

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

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

;

- DB flow rate

priority for LC or FCC with number

;

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

;

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

;

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

;

- the average size of the database for LC or FCC with a number

;

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

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

- allowable value of the mathematical expectation of DB delay

-th priority for the subnet of the hierarchical multi-level transport communication network;

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

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

Is the sum of the intensities of the database flows

-th priority for the subnet of the hierarchical multi-level transport communication network;

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

;

- DB distribution delay for LC or FCC with number

;

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

;

- the cost of rent per unit of throughput LC or FCC with a number

;

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

- the number of network elements (SE) for the corresponding subnet of the hierarchical multi-level transport communication network;

– общее число СЭ, ЛК или ФКС для соответствующей подсети иерархической многоуровневой транспортной сети связи.

- the total number of SE, LC or FCC for the corresponding subnet of the hierarchical multi-level transport communication network.

-го приоритета для физического канала связи или логического канала и для подсети иерархической многоуровневой транспортной сети связи в целом (на основе начальных значений, полученных в 106.1).106.2. Determination of the initial value of the average weighted mathematical expectation of the delay of data blocks

-th priority for the physical communication channel or logical channel and for the subnet of the hierarchical multi-level transport communication network as a whole (based on the initial values obtained in 106.1).

-го приоритета для подсети иерархической многоуровневой транспортной сети связи в целом рассчитывается по формулеWeighted average value of the mathematical expectation of the DB delay

priority for the subnet of the hierarchical multi-level transport communication network as a whole is calculated by the formula

, (2)

– математическое ожидание задержки БД

-го приоритета для подсети иерархической многоуровневой транспортной сети связи;Where

- mathematical expectation of a delay of a DB

-th priority for the subnet of the hierarchical multi-level transport communication network;

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

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

- the sum of the intensities of the database flows

-th priority for the subnet of the hierarchical multi-level transport communication network;

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

-го приоритета для ИН источник которого

-й СЭ соответствующей подсети иерархической многоуровневой транспортной сети связи, а адресат –

-й СЭ соответствующей подсети иерархической многоуровневой транспортной сети связи;

- DB flow rate

priority for ID whose source

th SE of the corresponding subnet of the hierarchical multilevel transport communication network, and the destination is

-th SE of the corresponding subnet of the hierarchical multi-level transport communication network;

– математическое ожидание задержки БД

-го приоритета для ИН источник которого

-й СЭ соответствующей подсети иерархической многоуровневой транспортной сети связи, а адресат –

-й СЭ соответствующей подсети иерархической многоуровневой транспортной сети связи;

- mathematical expectation of a delay of a DB

priority for ID whose source

th SE of the corresponding subnet of the hierarchical multilevel transport communication network, and the destination is

-th SE of the corresponding subnet of the hierarchical multi-level transport communication network;

 – задержка БД

-го приоритета для информационного направления (ИН) источник которого

-й СЭ соответствующей подсети иерархической многоуровневой транспортной сети связи, а адресат –

-й СЭ соответствующей подсети иерархической многоуровневой транспортной сети связи;

- DB delay

priority for the information direction (ID) whose source

th SE of the corresponding subnet of the hierarchical multilevel transport communication network, and the destination is

-th SE of the corresponding subnet of the hierarchical multi-level transport communication network;

– задержка БД

-го приоритета для соответствующей подсети иерархической многоуровневой транспортной сети связи;

- DB delay

-th priority for the corresponding subnet of the hierarchical multi-level transport communication network;

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

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

;

- DB flow rate

priority for FCC or LC or FCC with number

;

– число СЭ для соответствующей подсети иерархической многоуровневой транспортной сети связи;

- the number of SEs for the corresponding subnet of the hierarchical multi-level transport communication network;

– общее число СЭ, ФКС или ЛК для соответствующей подсети иерархической многоуровневой транспортной сети связи.

- the total number of SE, FCC or LC for the corresponding subnet of the hierarchical multi-level transport communication network.

-го приоритета в логическом канале рассчитывается по формуламMathematical expectation of DB delay

priority in the logical channel is calculated by the formulas

,; (3) ,. (four)

-го приоритета в ФКС рассчитывается по формуламMathematical expectation of DB delay

priority in the FCC is calculated by the formulas

,; (5) ,. (6)

106.3. Bandwidth allocation of physical communication channels:

, (7)

or

, (8)

Bandwidth allocation of logical channels:

,  (9)

or

, (10)

-го приоритета для физических каналов связи или логических каналов и для соответствующей подсети иерархической многоуровневой транспортной сети связи в целом (используются значения

, полученные в 106.3).106.4. Determining the value of the average weighted mathematical expectation of DB delay

priority for physical communication channels or logical channels and for the corresponding subnet of the hierarchical multi-level transport communication network as a whole (values are used

obtained in 106.3).

-го приоритета, полученное в 106.4, не отличается от начального значения, тогда работа алгоритма заканчивается. В противном случае начальные значения пропускных способностей физических каналов связи или пропускных способностей логических каналов принимаются равными тем, что были получены в 106.3. Начальное значение среднего взвешенного математического ожидания задержки БД

-го приоритета принимается равным тому, что было получено в 106.4 и осуществляется переход к 106.3.106.5. If the value of the average weighted mathematical expectation of the DB delay

-th priority obtained in 106.4 does not differ from the initial value, then the operation of the algorithm ends. Otherwise, the initial values of the bandwidth of the physical communication channels or the bandwidth of the logical channels are taken equal to those obtained in 106.3. Initial value of the average weighted mathematical expectation of DB delay

-th priority is taken equal to what was received in 106.4 and the transition to 106.3 is carried out.

107. Fill in the switching / routing, topology and resource management tables for the corresponding subnet of the hierarchical multi-level transport communication network.

Subnet switching tables of a hierarchical multi-level transport communication network are filled in using connected structures found by the maximum availability factor criterion for the corresponding connected structure. The subnet topology tables of the hierarchical multi-level transport communication network are filled using the calculated optimal logical structures of the subnet of the hierarchical multi-level transport communication network. The resource management tables are filled using the calculated optimal distribution of the logical channel capacity of the subnet of the hierarchical multi-level transport communication network.

108. Transfer to the network elements of the corresponding subnet of the hierarchical multilevel transport communication network switching / routing tables, topology, and resource management via physical / logical control channels.

109. Repeat steps 102-108 for the adjacent hierarchical multilevel transport communications network adjacent to the top of the hierarchy until at least the following verification condition occurs: the corresponding subnet of the hierarchical multilevel transport communications network does not have the adjacent hierarchical multilevel transport communication network.

If you change the topology in at least one of the subnets of the hierarchical multi-level transport communication network, or if you find at least one overloaded physical / logical communication channel in any subnet of the hierarchical multi-level transport communication network, the optimization steps are repeated, starting from the corresponding subnet of the hierarchical multi-level transport communication network while the underlying subnets of the hierarchical multi-level transport communication network remain unchanged.

The optimization stages of a hierarchical multi-level transport communication network begin with a subnet of a hierarchical multi-level transport communication network that does not have an adjacent hierarchy lower hierarchy of a multi-level transport communication network, while information about the availability factors of physical / logical communication channels is set by the operator of a hierarchical multi-level transport communication network, or can be obtained from the operator of the public transport communication network.

The claimed method for optimizing a hierarchical multilevel transport communication network allows to achieve the specified technical result by decomposing the general optimization problem into structural and parametric optimization problems of a hierarchical multilevel transport communication network in separate subnets of a hierarchical multilevel transport communication network, which reduces the complexity and number of calculations for optimizing a hierarchical multilevel transport communication network communication network.

A system for optimizing a hierarchical multilevel transport communication network (Fig. 3) contains, R subnets of a hierarchical multilevel transport communication network, designed to transmit data traffic from the sender node to the recipient node, R subnet controllers of the hierarchical multilevel transport communication network, for controlling and configuring subnets hierarchical multilevel transport communication network. The subnet controller of the hierarchical multilevel transport communication network includes (Fig. 4): a module for receiving / transmitting control parameters 406 for receiving information about data traffic from network elements, transmitting switching / routing tables, topology and resource management to network elements, a module for statistical traffic analysis 407, designed to analyze the load of physical / logical communication channels and network delay of data blocks, a module for finding connected structures 401, configured to find connected subnet structures of a hierarchical multi-level transport communication network by the criterion of minimum average latency of data blocks for the corresponding connected structures and by the maximum availability factor criterion for the corresponding connected structures, structural optimization module 402, configured to calculate the optimal logical structure of the subnet of the hierarchical multi-level transport communication network, with using information on traffic parameters from network elements of a hierarchical multilevel t subnet communication communications network, at least the average delay time of data blocks and availability factors of physical / logical communication channels, information about network elements of the subnet of a hierarchical multi-level transport communication network, information about found connected structures by the criterion of the minimum average delay time for the corresponding connected structures, parametric optimization module 403, configured to calculate an optimal bandwidth allocation of physical / logical communication channels of the subnet, and a hierarchical multilevel transport communication network, using information obtained from the hierarchy top level of the hierarchical multilevel transport communication network, at least the average size of data blocks and the intensity of receipt of data blocks, quality of service requirements, data module 408, designed to store the switching / routing table, topology and resource management, network events, 409 user interface module, designed to provide users with a network administrator user interface with which you can connect to the subnet controller of the hierarchical multi-level transport communication network and display information, an application program interface module 404 that allows the sub-controller of the hierarchical multi-level transport communication network to interact with one or more subnets of the hierarchical multi-level transport communication network, for example, for checking the status of the subnet of the hierarchical multi-level transport communication network, adding / removing new connected structures.

A subnet of a hierarchical multilevel transport communication network includes at least three network elements interconnected by physical / logical communication channels, while the total number of network elements of all subnets of a hierarchical multilevel transport communication network is equal to the number of network elements in a hierarchical multilevel transport communication network in whole.

The subnet controller of the hierarchical multilevel transport communication network is connected by control channels to at least the network elements of this and the adjacent lower / upper hierarchy subnet of the hierarchical multilevel transport communication network. Moreover, the control channels can be both physical (dedicated) and logical. A physical control channel is a physical line connecting a subnet controller of a hierarchical multi-level transport communication network to a network element. A logical control channel is a logical connection connecting a subnet controller of a hierarchical multi-level transport communication network and a network element.

Network elements of one subnet of a hierarchical multi-level transport communication network interact with network elements of the corresponding subnet of a hierarchical multi-level transport communication network and adjacent lower / upper hierarchy subnets of a hierarchical multi-level transport communication network using interface connections.

A network element of a subnet of a hierarchical multi-level transport communication network can be implemented according to a well-known scheme, for example, as a Programmble Flow switch PF5340-48XP-6Q (see www.nstor.ru/ru/news/lenta/nec_pf5340_48xp_6q_32qp.html).

A subnet controller of a hierarchical multi-level transport communication network can be implemented according to a well-known scheme, for example, as a NEC PF6800 Programmable Flow SDN Controller (see https://www.nec.com/en/global/prod/pflow/images_documents/ProgrammableFlow_Brochure.pdf )

An interactive system process for optimizing a hierarchical multi-level transport communications network is described below.

The network elements of the subnet of the hierarchical multilevel transport communication network transmit information about the traffic parameters and their status to the subnet controller of the hierarchical multilevel transport communication network via the physical / logical control channel.

The subnet controller of the hierarchical multilevel transport communication network, through the parameter reception / transmission module, receives information on the traffic parameters from the network elements of the corresponding subnet of the hierarchical multilevel transport communication network, such as the average delay time of data blocks, availability factors of physical / logical communication channels via the physical / logical control channel , loading physical / logical communication channels of a subnet of a hierarchical multi-level transport communication network.

In the module of statistical traffic analysis, the workload of physical / logical communication channels, the loss ratio of data blocks and the network delay of data blocks in a subnet of a hierarchical multi-level transport communication network are analyzed.

Traffic parameters are transferred to the module for finding connected structures in order to find connected structures of the subnet of the hierarchical multi-level transport communication network such as shortest routes, spanning trees, Hamiltonian chains and cycles according to the criterion of the minimum average data block delay time for the corresponding connected structure.

In the structural optimization module, the optimal logical structure of the subnet of the hierarchical multi-level transport communication network is calculated using information on the traffic parameters from the network elements of the subnet of the hierarchical multi-level transport communication network, at least the average delay time of the data blocks and the availability factors of physical / logical communication channels, network information subnet elements of a hierarchical multi-level transport communication network, information about found connected structures by criterion th minimum average delay time for the respective connected structures. The optimal logical structure of the corresponding subnet of the hierarchical multi-level transport communication network is transmitted to the module for finding connected structures, the parametric optimization module, and the data module. In the data module, based on the optimal logical structure, the subnet topology tables of the hierarchical multi-level transport communication network are filled.

In the module for finding connected structures based on the optimal logical subnet structure of a hierarchical multi-level transport communication network, find connected subnet structures of a hierarchical multi-level transport communication network such as shortest routes, spanning trees, Hamiltonian chains and cycles according to the maximum availability factor for the corresponding connected structures. These connected structures are transmitted to the data module to populate the switching / routing tables of the subnet of the hierarchical multi-level transport communication network.

In the parametric optimization module, the optimal distribution of the bandwidth of the physical / logical communication channels of the subnet of the hierarchical multi-level transport communication network is calculated using information obtained from the hierarchy of the hierarchical multi-level transport communication network from the top subnet of the network, at least the average size of the data blocks and the intensity of the data blocks, requirements for quality of service. The optimal bandwidth allocation of the physical / logical communication channels is transmitted to the data module to populate the subnet resource management tables of the hierarchical multi-level transport communication network.

The data module receives information about the connected structures found by the maximum availability factor criterion for the corresponding connected structures, and fills in the switching / routing tables, receives information about the optimal logical structure of the corresponding subnet of the hierarchical multi-level transport communication network and fills in the topology tables, receives information about the optimal bandwidth allocation abilities of physical / logical channels of a subnet of a hierarchical multilevel transport communication network and Lifts resource management tables. The tables of switching / routing, topology and resource management of the subnet of the hierarchical multi-level transport communication network are transmitted via the parameter reception / transmission module via physical / logical control channels to the network elements of the subnet of the hierarchical multi-level transport communication network.

The network elements of the hierarchical multilevel transport communication network subnet receive the switching / routing table, topology and resource management tables for the corresponding subnet of the hierarchical multilevel transport communication network via the physical / logical control channel and fills in their switching, topology and resource management tables.

The network elements of the hierarchical multilevel transport communication network subnet interact with the network elements of the lower / upper hierarchy subnets of the hierarchical multilevel transport communication network using interface connections, which define the rules for interaction between the network elements of the hierarchical multilevel transport communication network adjacent to the hierarchy of subnets.

If the controller of any subnet of the hierarchical multilevel transport communication network or the physical / logical control channels of network elements of the corresponding subnet of the hierarchical multilevel transport communication network fails, the control of the network elements of the corresponding subnet of the hierarchical multilevel transport communication network passes to the controller of the adjacent hierarchical multilevel transport subnet hierarchy communication network. If there is no adjacent hierarchy lower subnet of the hierarchical multi-level transport communication network, then control passes to the controller of the adjacent hierarchy lower subnet hierarchy of the multi-level transport communication network. Thus, the reliability of the control level of the hierarchical multilevel transport communication network has increased, with the same number of subnet controllers of the hierarchical multilevel transport communication network.

The claimed system for optimizing a hierarchical multi-level transport communication network allows to achieve the specified technical result by connecting each subnet controller of the hierarchical multi-level transport communication network with physical / logical control channels, at least with network elements of two hierarchically adjacent subnets of the hierarchical multi-level transport communication network, which increases the reliability of the control level of a hierarchical multi-level transport communication network.

Most of the known algorithms for solving basic structural network problems used in the optimization process of a hierarchical multi-level transport communication network have a polynomial or exponential estimate of computational complexity. Thus, the computational complexity of the task of optimizing a hierarchical multi-level transport communication network is such that even for a relatively simple network, considerable time costs may be required. With an increase in the number of network elements in a hierarchical multi-level transport communications network, the computational complexity of individual tasks increases polynomially, and other tasks exponentially.

In this embodiment, the general optimization task of a hierarchical multilevel transport communication network is decomposed into several simpler structural and parametric optimization problems in separate subnets of a hierarchical multilevel transport communication network, while the number of network elements in each such subnet is significantly less than the total number of network elements. This, in turn, allows to reduce the complexity and the number of calculations while optimizing a hierarchical multi-level transport communication network.

The validity of the theoretical assumptions was checked by an example of solving the problem of searching for connected structures by the double search method. Suppose that a hierarchical multilevel transport communication network includes 80 network elements, 10 information directions, three shortest routes are used in each information direction. We will split the hierarchical multi-level transport communication network into separate subnets using the following expression:

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

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

, в третьей подсети иерархической многоуровневой транспортной сети связи

.As

, then round up to an integer up and get three subnets, forming a hierarchical multi-level transport communication network. In the first subnet of the hierarchical multilevel transport communication network, the number of network elements is equal to

, in the second subnet of the hierarchical multilevel transport communication network

, in the third subnet of a hierarchical multilevel transport communication network

.

Now we estimate the computational complexity of finding the three shortest routes using the double search algorithm (see Phillips, D. Methods of network analysis: translated from English / D. Phillips, A. Garcia-Diaz. - M: Mir, 1984. - 102 p. )

,

,

– количество кратчайших маршрутов,

– число сетевых элементов.Where

- the number of shortest routes,

- the number of network elements.

количество вычислений.For the prototype we get

number of calculations.

The computational complexity of finding the three shortest routes using the double search algorithm according to the invention, taking into account the division of the hierarchical multilevel transport communication network into three subnets of the hierarchical multilevel transport communication network, will have the form:

количество вычислений. Как видим, согласно предполагаемого изобретения в 9 раз снижается количество вычислений только на этапе нахождения связных структур в процессе структурной оптимизации иерархической многоуровневой транспортной сети связи. Таким образом, за счет декомпозиции общей задачи оптимизации иерархической многоуровневой транспортной сети связи на задачи структурной и параметрической оптимизации в отдельных подсетях иерархической многоуровневой транспортной сети связи достигается решение данной технической проблемы.Obtaining computational complexity according to an embodiment of the invention

number of calculations. As we see, according to the proposed invention, the number of calculations is reduced by a factor of 9 only at the stage of finding connected structures in the process of structural optimization of a hierarchical multi-level transport communication network. Thus, due to the decomposition of the general optimization problem of the hierarchical multilevel transport communication network, the structural and parametric optimization problems in separate subnets of the hierarchical multilevel transport communication network achieve this technical problem.

In this embodiment, the reliability of the control level of the hierarchical multilevel transport communication network is increased by connecting each subnet controller of the hierarchical multilevel transport communication network with physical / logical control channels, at least with the network elements of two adjacent lower / upper hierarchy subnets of the hierarchical multilevel transport communication network.

It should be noted that the above embodiments are provided only to describe the technical solutions of the present invention, but do not limit the present invention. Those skilled in the art should understand that although the present invention has been described in detail with reference to exemplary embodiments, modifications and equivalent replacements of the technical solutions of the present invention can be made until such modifications and replacements deviate from the idea. and the scope of technical solutions of the present invention.

Claims (17)

1. A method for optimizing a hierarchical multi-level transport communication network in which a) after dividing the hierarchical multilevel transport communication network into subnets of the hierarchical multilevel transport communication network, information on user service levels, information on traffic parameters from network elements of the corresponding subnet of the hierarchical multilevel transport communication network, such as the average delay time of data blocks, physical availability factors / logical communication channels, loading physical / logical communication channels of the corresponding hierarchical multi-level subnet th transport network, b) after filling in the switching, topology and resource management tables for the corresponding subnet of the hierarchical multi-level transport communication network, transfer to the network elements of the corresponding subnet of the hierarchical multi-level transport communication network switching / routing tables, topology and resource management, characterized in that c) the hierarchical multilevel transport communication network is first divided into R subnets of the hierarchical multilevel transport communication network, d) find connected structures for the corresponding subnet of the hierarchical multi-level transport communication network according to the criterion of the minimum average delay time of data blocks for the corresponding connected structure, e) calculate the optimal logical structure for the corresponding subnet of the hierarchical multi-level transport communication network, using the average delay time of data blocks and availability factors of physical / logical communication channels for the corresponding subnet of the hierarchical multi-level transport communication network, information about network elements of the corresponding subnet of the hierarchical multi-level transport communication network , information on found connected structures by the criterion of the minimum average delay time d I connected the corresponding structures of the corresponding subnet hierarchical multi-level transport network, f) find connected structures on the optimal logical structure of the corresponding subnet of the hierarchical multi-level transport communication network according to the criterion of the maximum availability factor of physical / logical communication channels for the corresponding connected structures of the corresponding subnet of the hierarchical multi-level transport communication network, g) calculate the optimal distribution of the bandwidth of the physical / logical communication channels of the corresponding subnet of the hierarchical multilevel transport communication network using information received from the adjacent hierarchy of the hierarchy of the multilevel transport communication network, at least the average size of data blocks and the intensity of the arrival of data blocks, requirements for quality of service h) fill in the switching / routing, topology and resource management tables for the corresponding subnet of the hierarchical multi-level transport communication network, j) repeat steps a, b) and d) -h) for the adjacent hierarchical multilevel transport communication network, the top subgroup hierarchy until at least the following verification condition occurs: the corresponding subnet of the hierarchical multilevel transport communication network has no adjacent upper hierarchy subnet hierarchical multi-level transport communications network. 2. The method according to claim 1, in which, if you change the topology in at least one subnet of the hierarchical multi-level transport communication network or if you find at least one overloaded physical / logical communication channel in any subnet of the hierarchical multi-level transport communication network, repeat steps a, b) and d) -h) starting from the corresponding subnet of the hierarchical multilevel transport communication network, while the underlying subnets of the hierarchical multilevel transport communication network remain unchanged. 3. The method according to claim 1, in which steps a, b) and d) -k) begin with a subnet of a hierarchical multilevel transport communication network, which does not have an adjacent lower hierarchy subnet of a hierarchical multilevel transport communication network, while information about availability factors physical / logical communication channels is set by the operator of a hierarchical multi-level transport communication network. 4. A system for optimizing a hierarchical multi-level transport communication network, containing R subnets of a hierarchical multi-level transport communication network, designed to transmit data traffic from the sender node to the recipient node, R subnet controllers of the hierarchical multi-level transport communication network, for controlling and configuring the corresponding subnets of the hierarchical multi-level transport communication network, while the subnet controller of the hierarchical multi-level transport communication network VK includes: a module for receiving / transmitting control parameters for receiving information about data traffic from network elements, transmitting switching / routing tables, topology and resource management to network elements, a statistical traffic analysis module designed to analyze the load of physical / logical communication channels and network delay data blocks, a module for finding connected structures, configured to find connected structures of a subnet of a hierarchical multi-level transport communication network by the criterion of mini mind the average delay time of data blocks for the corresponding connected structure and according to the criterion of the maximum availability factor for the corresponding connected structures, a structural optimization module configured to calculate the optimal logical structure of the subnet of a hierarchical multi-level transport communication network using information about traffic parameters from network elements of the corresponding subnet hierarchical multi-level transport communication network, at least average data block delay time x and availability factors of physical / logical communication channels, information about network elements of the corresponding subnet of a hierarchical multi-level transport communication network, information about found connected structures by the criterion of minimum average delay time for the corresponding connected structures, a parametric optimization module configured to calculate the optimal bandwidth allocation physical / logical communication channels of a subnet of a hierarchical multi-level transport communication network, using using information obtained from an adjacent hierarchy top subnet hierarchy of a multilevel transport communications network, at least the average data block size and data block arrival rate, quality of service requirements, a data module for storing the switching / routing table, topology and resource management, network events , a user interface module designed to connect to the controller the corresponding subnet of a hierarchical multi-level transport network with ides, and outputting information, application interface module that allows the controller subnet hierarchical multi-layered transport network to communicate with one or more subnets hierarchical multi-level transport network connection, for example, to check the status of the subnet hierarchical multi-level transport network, add / delete new connected structures. 5. The system according to claim 4, in which the subnet of the hierarchical multi-level transport communication network includes at least three network elements interconnected by physical / logical communication channels, while the total number of network elements of subnets of the hierarchical multi-level transport communication network is equal to the number of network elements in a hierarchical multi-level transport communication network as a whole. 6. The system according to claim 4, in which the subnet controller of the hierarchical multi-level transport communication network is connected by physical / logical control channels with at least network elements of the corresponding subnet of the hierarchical multi-level transport communication network and the adjacent lower / upper hierarchy subnets of the hierarchical multi-level transport communication network. 7. The system according to claim 4, in which the network elements of a subnet of a hierarchical multi-level transport communication network interact with network elements of hierarchically adjacent subnets of a hierarchical multi-level transport communication network using interface connections.

Images