RU2834974C9 - Device for determining optimal route of transmitting information in communication system - Google Patents

Abstract

FIELD: physics.

SUBSTANCE: invention relates to devices for determining the information transmission route. Result is achieved due to distribution of information flows. Device comprises a unit for measuring-calculator of possible routes (1), a group of counters (2.1.M) and dividers (3.1.M), to which values of the measurement time interval are supplied, a group of multipliers (4.1.M), memory device (MD) (5.1), adder (6.1), divider (7), comparison circuit (8), second MD (5.2), the output of which is the output of the device. Additionally, introduced are the second groups of counters (2.2.M), adders (9.M) and dividers (3.2.M), to which the values of the number of measurements n are supplied. Dividers (3.2.M) are connected to a group of multipliers (4.1.M). Also introduced are third (5.3) and fourth (5.4) MDs, second group of multipliers (4.2.M), second adder (6.2) connected to divider 7. MD 5.4 is connected to control inputs of MD 5.1, and MD 5.3 of adders 6.1 and 6.2. Unit 1 is connected to MD 5.2, MD 5.4, and control input of MD 5.2. MD 5.2 is connected to comparison circuit 8, which is connected to control input of unit 1.

EFFECT: reduced time delay and packet loss.

1 cl, 1 dwg

Description

The invention relates to telecommunication technology, in particular to devices for determining the optimal route for transmitting information in a communication system based on a generalized indicator for assessing the effectiveness of information exchange (information effectiveness), and can be used in creating new and improving existing automated control systems, message-switched communication networks, packet-switched communication networks, including fast packet-switched communication networks.

A device for determining the shortest path in a graph is known [patent SU No. 842842 A1, G06G 7/122, 30.06.1981, Bulletin No. 24], which contains: a matrix model of the graph; a control unit; a clock pulse generator; according to the number of rows and columns of the matrix model of the graph: differentiating chains and arc formers, including triggers and counters; according to the number of columns of the matrix model of the graph: OR elements, the first and second groups of triggers, a group of NOT elements, the first, second, third and fourth groups of AND elements, the first and second groups of counters, a group of comparison circuits. The control unit contains the first and second AND elements, a start and stop unit, a counter and a decoder. The matrix model of the graph is a matrix of homogeneous cells of arc weight generators with differentiating chains of size n×n, where n is the maximum number of nodes of the modeled graph.

The disadvantage of this device is that to determine the shortest paths between nodes in the graph, the weight of arcs in the form of the arc travel time value and the criterion of the minimum travel time from node to node are used, the use of which does not allow finding the shortest route taking into account the simultaneous use of communication system resources for storing and transmitting information.

There is also a device for determining minimal paths in graphs [patent SU No. 1242982 A1, G06F 15/20, 07.07.1986, Bulletin No. 25], containing a matrix model of a graph; arc formers according to the number of rows and columns of the matrix model of the graph; according to the number of columns of the matrix model of the graph: the first and second groups of OR elements, a group of triggers, a group of NOT elements, the first, second, third and fourth groups of AND elements, registration counters, a group of registration triggers; a unit for calculating the code of the maximum number, a memory unit, a differentiating chain, a clock pulse generator, an AND-NOT element, two AND elements, an OR element, a NOT element, the first and second counters, the first and second decoders, and a device trigger input. The arc former contains the first and second triggers, the first and second AND elements, a differentiating chain. A memory block corresponding to the number of rows and columns of the matrix graph model contains: a group of AND elements, a group of triggers, a group of OR elements corresponding to the number of columns of the matrix graph model, and a group of NOT elements.

The disadvantages of this device are: not all routes from the initial node to the final node in the graph are determined, but only independent paths on the graph; it is impossible to determine the optimal route from the initial node to the final node in the communication system according to a given criterion.

The closest in technical essence to the claimed invention is a device for determining paths in a graph [patent SU No. 1292000 A1, G06F 15/20, 23.02.1987, Bulletin No. 7], comprising: first and second memory blocks; registration unit; first, second, third, fourth and fifth registers; first, second, third and fourth equality comparison blocks; first, second, third, fourth and fifth multiplexers; counters; accumulating adder; greater-less comparison block; OR element; pulse generator; register block. As a result of the device operation, all paths in the graph between its initial and final vertices are formed in the registration unit and the weights of these paths are determined.

The disadvantages of the prototype are: the solution to the routing problem does not take into account the capabilities of the communication system for transmitting and storing information; the procedures for finding the optimal route in the communication system, which reduce the average time delay and packet loss, are not defined.

The technical result of the proposed device is a reduction in the average time delay and packet loss due to the optimal distribution of information flows in the communication system during the transmission of information from the sending node to the receiving node by determining the optimal route based on a generalized indicator - the efficiency coefficient (ECC) of information transmission.

The technical result is achieved in that in the device for determining the optimal route for transmitting information in a communication system, comprising a measuring-calculating unit for all possible routes from a sending node to a receiving node, according to the invention, a first group of counters, a first group of dividers, connected in series according to the number M of intervals of the communication system, to the second inputs of which the values of a given measurement time interval Δt _da , a first group of multipliers, a first storage device, a first adder, a divider, a comparison circuit, a second storage device, the first output of which is the output of the device are additionally introduced; also additionally introduced are a second group of counters, a group of adders, a second group of dividers, connected in series according to the number M of intervals of the communication system, to the second inputs of which the values of a number of measurements n are fed, and the outputs of the second group of dividers are connected to the second inputs of the first group of multipliers; in addition, a fourth storage device and a second group of multipliers, a third storage device, a second adder, the output of which is connected to the second input of the divider, connected in series according to the number M of intervals of the communication system are additionally introduced; the first output of the fourth storage device is connected to the control inputs of the first and third storage devices, and the second output of the fourth storage device is connected to the control inputs of the first and second adders; the first output of the unit of the measuring-calculator of all possible routes from the sender node to the recipient node is connected to the inputs of the second and fourth storage devices, and the second output of the unit of the measuring-calculator of all possible routes from the sender node to the recipient node is connected to the second control input of the second storage device, the second output of which is connected to the second input of the comparison circuit, the second output of which is connected to the control input of the unit of the measuring-calculator of all possible routes from the sender node to the recipient node (figure).

The distinguishing feature concerning the additional introduction of: first and second groups of counters; first and second groups of dividers; first and second groups of multipliers; a group of adders; first, second, third and fourth storage devices; first and second adders; a divider; a comparison circuit, is explained as follows.

After a specified measurement time interval Δt _zad , data are fed from the communication system for each m-th communication interval (from the set of all communication intervals m=1…M), consisting of the m-th buffer storage device (BSD) and the m-th communication channel (CC), to the inputs of the first and second groups of counters. In the first group of counters, for each m-th communication interval, operations are performed to count the number of information packets transmitted through each m-th CC r _m . In the second group of counters, for each m-th communication interval, after the required period of time, , which is equal to the value of the specified measurement time interval Δt _divided by the value of the number of measurements n, perform operations to count the number of information packets q _j,m stored in each m-th BZU at the current j-th moment in time, which are output to the corresponding inputs of the adder group, then the second group of counters is reset ("set 0" through τ _mp ). In the adder group for each m-th communication interval, operations are performed to add the incoming current values q _j,m and calculate the values of the number of information packets , stored in each m-th BZU for a given measurement time interval Δt _zad . Then, after Δt _{zad ,} the values r _m are output from the outputs of the first group of counters to the corresponding first inputs of the first group of dividers, to the second inputs of which the values of the given measurement time interval Δt _zad are fed. The values q _m are output from the outputs of the group of adders to the corresponding first inputs of the second group of dividers, to the second inputs of which the values of the number of measurements n are fed. After that, the group of adders and the first group of counters are reset ("set. 0" after Δt _zad ). In the first group of dividers, operations are performed to divide the values r _m by the values Δt _zad , calculating the average values of the information transfer rate each m-th CS, which are output to the corresponding first inputs of the first group of multipliers. In the second group of dividers, operations of dividing the values of q _m by the values of n are performed, calculating the average values of the number of information packets , stored in each m-th BZU, which are output to the corresponding second inputs of the first group of multipliers. In the first group of multipliers, the operations of multiplying the values of V _m and Q _m are performed, determining the values of the cybernetic power KW _m =V _m ⋅Q _m of each m-th communication interval, which are output to the inputs of the first storage device, where they are stored. Also, after a specified measurement time interval Δt _zad from the communication system for each m-th communication interval, the values of the capacity N _m of each m-th BZU and the throughput C _m of each m-th CS are fed, respectively, to the first and second inputs of the second group of multipliers. In the second group of multipliers, the operations of multiplying the values of N _m and C _m are performed, determining the values of the total cybernetic power each m-th communication interval, which are fed to the inputs of the third storage device, where they are stored.

In this case, taking into account the operations carried out above, the values of the cybernetic power KW _m and the total cybernetic power are stored in the first and third storage devices , respectively, for each m-th communication interval of the communication system, which are rewritten (updated) after a specified measurement time interval Δt _zad .

After that, through Δt _back, data from the communication system are fed to the input of the measuring-calculating unit of all possible routes from the sending node to the receiving node, made according to the scheme presented in the patent [SU No. 1292000 A1, G06F 15/20, 23.02.1987, Bulletin No. 7], in which all routes from the sending node to the receiving node (i=1…I) are stored and the presence of information about possible routes is checked. In the case of availability of information on possible routes from the output of the measuring-calculating unit of all possible routes from the sender node to the recipient node, information on the current i-th route L _i , consisting of m-th communication intervals, is simultaneously output to the input of the fourth storage device, in which it is stored, and to the input of the second storage device, in which information on the current i-th route L _i is stored in the presence of a signal at its first control input. Then, from the first output of the fourth storage device, information on each m-th communication interval included in the current i-th route is sequentially output to the control inputs of the first and third storage devices. Based on the signals at the control inputs of the first and third storage devices, the values of the cybernetic power KW _m and the total cybernetic power corresponding to the m-th communication intervals included in the current i-th route, to the inputs of the first and second adders, respectively. Then the information about the m-th communication intervals included in the current i-th route is deleted in the fourth memory device. In the first and second adders, the operations of adding, respectively, the sequentially arriving values of the cybernetic power KW _m and the total cybernetic power , determining the values of cybernetic power and full cybernetic power the current i-th route from the sender node to the recipient node, respectively. After that, as the information about the m-th communication intervals included in the current i-th route is output from the fourth storage device to the control inputs of the first and third storage devices, then in the fourth storage device a signal is formed and sent from its second output to the control inputs of the first and second adders. Based on the signals at the control inputs of the first and second adders, the values of KW _i and , respectively, to the first and second inputs of the divider. Then the first and second adders are reset ("set 0").

In the divider, the operation of dividing the value of KW _i by the value is carried out , determining the value of the efficiency of information transfer the current i-th route from the sender node to the recipient node, which is fed from the output of the divider to the first input of the comparison circuit, to the second input of which the current minimum value of the efficiency of information transfer is fed from the second output of the second storage device. Since initially in the second storage device the value and information about the current optimal route are absent, then the value η _i from the first output of the comparison circuit is immediately fed to the first control input of the second storage device, where it is stored , and also remember information about the current optimal route . In subsequent calculations in the divisor, the values of η _i in the comparison circuit are compared with the value , and if η _i < , then the value η _i from its first output is fed to the first control input of the second storage device. Based on the signal at the first control input of the second storage device, the current minimum value of the information transfer efficiency is stored (updated) and the current optimal route . Then, in the comparison circuit, a signal is generated and sent from its second output to the control input of the measuring-calculating unit of all possible routes from the sending node to the receiving node, including in the event that the condition is not met in the comparison circuit. At the control input of the block measuring-calculating all possible routes from the sender node to the recipient node, information about the current i-th route L _i is deleted and the presence of information about other possible routes from the sender node to the recipient node is checked. If the block measuring-calculating all possible routes from the sender node to the recipient node has information about another possible route, then its first output outputs information about the next current i-th route L _i to the inputs of the fourth and second storage devices. If there is no information about other possible routes in the block measuring-calculating all possible routes from the sender node to the recipient node, a signal is generated and sent from its second output to the second control input of the second storage device. At the signal at the second control input of the second storage device, information about the optimal route is output to its first output, which is the output of the device. between the sending node and the receiving node. Then _after Δt the second memory device is reset to zero ("set 0"). After which the above measurements and calculations are continued.

The conducted studies show that determining the optimal route from the sending node to the receiving node based on the criterion of the minimum value of the efficiency of information transmission on all possible routes ensures a reduction in the average time delay and packet loss in the communication system due to the optimal distribution of information flows during information transmission. The efficiency of information transmission when solving the routing problem takes into account the use of communication system resources during the transmission and storage of information in relation to its potential capabilities based on a simultaneous assessment of the speed characteristics (bandwidths) of communication channels and the loading parameters (capacity) of buffers along the information transmission route [Mezhev A.M., Korennoy A.V. Evaluation of the effectiveness of network information systems by a generalized indicator // Radio Engineering. 2021. No. 3. Pp. 65-77].

The invention is further explained by a description of examples of its implementation and the attached drawing, in which the figure depicts a schematic drawing of a device for determining the optimal route for transmitting information in a communication system, according to the invention.

The device for determining the optimal route for transmitting information in a communication system (figure) contains:

a measuring and computing unit for all possible routes from the sending node to the receiving node 1, made according to the circuit presented in the patent [SU No. 1292000 A1, G06F 15/20, 23.02.1987, Bulletin No. 7], and intended for: receiving data from the communication system after a specified measurement time interval Δt _дача and storing all routes from the sending node to the receiving node; checking information on possible routes and, if available, simultaneously issuing information on the current i-th route L _i from the first output to the inputs of storage devices 5.2 and 5.4, and if there is no information on possible routes, generating and issuing a signal from the second output to the second control input of storage device 5.2; deleting information on the current i-th route L _i and subsequently checking for the presence of information on other possible routes based on the signal at the control input;

a group of counters 2.1.M, designed to receive data from the communication system during a specified measurement time interval Δt _zad and to perform a count of the number of information packets r _m transmitted through each m-th CS, as well as to output, through Δt _zad, the values of r _m to the corresponding first inputs of the group of dividers 3.1.M;

group of counters 2.2.M, designed to receive data from the communication system during the required period of time (where n is the number of measurements over time Δt _zad ) and performing the calculation of information packets q _j,m stored in each m-th memory unit at the current j-th moment in time, as well as for the sequential output through τ _mp of the values of q _j,m to the corresponding inputs of the group of adders 9.M;

group of dividers 3.1.M, intended for: performing operations of dividing the values of the number of information packets r _m , transmitted through each m-th CS during time Δt _zad , by the values of the specified measurement time interval Δt _zad ; calculating the average values of the information transfer rate each m-th CS; output of values V _m to the corresponding first inputs of the group of multipliers 4.1.M;

group of dividers 3.2.M, intended for: performing operations of dividing the values of the number of information packets q _m , stored in each m-th BZU for time Δt _set by the values of the number of measurements n; calculating the average values of the number of information packets , stored in each m-th memory unit; output of the values of Q _m to the corresponding second inputs of the group of multipliers 4.1.M;

group of multipliers 4.1.M, intended for: performing operations of multiplying the average values of the information transfer rate V _m of each m-th communication unit and the number of information packets Q _m stored in each m-th communication unit; determining the values of the cybernetic power KW _m of each m-th communication interval; issuing the values of KW _m to the inputs of the storage device 5.1;

group of multipliers 4.2.M, intended for: obtaining from the communication system the values of the capacity of each m-th BZU N _m and the throughput of each m-th CS C _m ; performing operations of multiplying the values of N _m and C _m ; determining the values of the total cybernetic power each m-th communication interval; output of values to the inputs of the memory device 5.3;

storage device 5.1, designed for storing (updating) through Δt the _values of the cybernetic power KW _m of each m-th communication interval, as well as for sequentially outputting the value of the cybernetic power KW _m of the m-th communication interval to the input of adder 6.1 based on a signal at the control input;

storage device 5.2, designed for: storing (updating) the current minimum value of the information transfer efficiency and information about the current optimal route by signal at the first control input; output of the value from the second output to the second input of the comparison circuit 8; issuing information about the optimal route L ^opt between the sender node and the recipient node to the first output, which is the output of the device, according to the signal at the second control input;

storage device 5.3, designed to store (update) through _Δt the values of the total cybernetic power each m-th communication interval, as well as for the sequential output of the value of the total cybernetic power m-th communication interval to the input of adder 6.3 according to the signal at the control input;

storage device 5.4, intended for: storing information about the current i-th route L _i ; checking information about the communication intervals included in L _i , and, if they are present, sequentially issuing information about each m-th communication interval from the first output to the control inputs of storage devices 5.1 and 5.3, followed by deleting information about the current m-th communication interval, and, if there is no information about the communication intervals, generating and issuing a signal from the second output to the control inputs of adders 6.1 and 6.3;

adder 6.1, designed to perform operations of adding the values of cybernetic power KW _m of the m-th communication intervals sequentially arriving at its input, and to output the value of cybernetic power the current i-th route to the first input of divider 7 according to the signal at the control input;

adder 6.2, designed to perform operations of adding the values of the total cybernetic power m-th communication intervals, successively arriving at its input, and for issuing the value of the total cybernetic power the current i-th route to the second input of divider 7 according to the signal at the control input;

divider 7, designed for: performing the operation of dividing the value of cybernetic power KW _i by the value of total cybernetic power current i-th route; determining the value of the efficiency of information transfer current i-th route; output of values η _i to the first input of comparison circuit 8;

comparison circuit 8, designed for: outputting the value of the efficiency of information transfer η _i from the first output to the first control input of the memory device 5.2 during the first calculation of the value of η _i in the divider 7, as well as when the inequality is satisfied ; performing the operation of comparing the value of the efficiency of information transfer η _i of the current i-th route and the current minimum value of the efficiency of information transfer in subsequent calculations of the value of η _i in divider 7; formation and output of a signal from the second output to the control input of the measuring-calculating unit of all possible routes from the sending node to the receiving node 1;

group of adders 9.M, intended for: performing the operation of adding the values of the number of information packets q _j,m sequentially arriving at the corresponding inputs, stored in each m-th BZU at the current j-th moment in time; determining the values of the number of information packets , stored in each m-th BZU for time Δt _zad ; output after Δt _zad values q _m to the corresponding first inputs of the group of dividers 3.2.M;

All operations performed in the device blocks can be implemented, for example, on the basis of high-speed microcontrollers [Belov A.V. Self-study Guide for Developers of Devices on AVR Microcontrollers. St. Petersburg: Science and Technology, 2008. 544 p.; Mikushin A.V., Sazhnev A.M., Sedinin V.I. Digital Devices and Microprocessors. St. Petersburg: BHV-Petersburg, 2010. 832 p.].

The device (figure) operates as follows.

Based on the data received during a specified measurement time interval Δt _zad from the communication system to the inputs of counter groups 2.1.M and 2.2.M, for each m-th communication interval: in counter group 2.1.M, operations are performed to count the number of information packets transmitted through each m-th CS r _m ; in counter group 2.2.M, during time Δt _{zad ,} operations are performed to count the number of information packets q _j,m stored in each m-th BPD at the current j-th moment in time. From the outputs of counter group 2.2.M, the values q _j,m are sent through τ _mp to the corresponding inputs of adder group 9.M, after which counter group 2.2.M is reset ("set. 0" through τ _mp ). In the group of adders 9.M, for each m-th communication interval, operations of adding the values of q _j,m are performed and the values of the number of information packets are calculated (where n is the number of measurements) stored in each m-th BZU for Δt _zad . Then, after Δt _zad , the values r _m are output from the outputs of the counter group 2.1.M to the corresponding inputs 1 of the divider group 3.1.M, to the inputs 2 of which the values Δt _zad are supplied. The values q _m are output from the outputs of the adder group 9.M to the corresponding inputs 1 of the divider group 3.2.M, to the inputs 2 of which the values of the number of measurements n are supplied. After that, the adder group 9.M and the counter group 2.1.M are reset to zero ("set 0" after Δt _zad ). In the divider group 3.1.M, the operations of dividing the values r _m by the values Δt _zad are performed, calculating the average values of the information transfer rate V _m of each m-th CS, which are output to the corresponding inputs 1 of the multiplier group 4.1.M. In the group of dividers 3.2.M, the operations of dividing the values q _m by the values n are performed, calculating the average values of the number of information packets Q _m stored in each m-th BZU, which are fed to the corresponding inputs of 2 groups of multipliers 4.1.M. In the group of multipliers 4.1.M, the operations of multiplying the values V _m and Q _m are performed, determining the values of the cybernetic power KW _m of each m-th communication interval, which are fed to the inputs of the storage device 5.1, where they are stored. Also, through Δt _back from the communication system for each m-th communication interval, the values of the capacity N _m of each m-th BZU and the throughput C _m of each m-th CS are fed, respectively, to inputs 1 and 2 of the group of multipliers 4.2.M. In the group of multipliers 4.2.M, the operations of multiplying the values N _m and C _m are performed, determining the values of the total cybernetic power each m-th communication interval, which are output to the inputs of the memory device 5.3, where they are stored.

After that, based on the data coming through Δt _back from the communication system to the input of the unit for measuring and computing all possible routes from the sender node to the recipient node 1, made according to the scheme presented in the patent [SU No. 1292000 A1, G06F 15/20, 23.02.1987, Bulletin No. 7], all routes from the sender node to the recipient node (i=1…I) are stored and the presence of information on possible routes is checked. If information on possible routes is available from the output of the unit for measuring and computing all possible routes from the sender node to the recipient node 1, information L _i on the current i-th route is simultaneously output to the input of the storage device 5.4, in which it is stored, and to the input of the storage device 5.2, in which L _i is stored in the presence of a signal at “control input 1”. Then, from output 1 of storage device 5.4, information about each m-th interval included in the current i-th route is sequentially output to the “control input” of storage devices 5.1 and 5.3. Based on signals to the “control input” of storage devices 5.1 and 5.3, the values of KW _m and corresponding to the m-th communication intervals included in the current i-th route, to the inputs of adders 6.1 and 6.2, respectively. Then the information about the m-th communication intervals included in the current i-th route is deleted from the memory device 5.4. In adders 6.1 and 6.2, the operations of adding, respectively, the sequentially arriving values of KW _m and , determining the values of cybernetic power KW _i and total cybernetic power the current i-th route from the sender node to the recipient node, respectively. After that, as the information about the m-th communication intervals included in the current i-th route is issued from the storage device 5.4 to the "control input" of the first and third storage devices 5.1 and 5.3, then in the storage device 5.4 a signal is formed and sent from its output 2 to the "control input" of adders 6.1 and 6.2. Based on the signals to the "control input" of adders 6.1 and 6.2, the values of KW _i and , respectively, to inputs 1 and 2 of divider 7. Then adders 6.1 and 6.2 are reset (“set 0”).

In divider 7, for each i-th route, the operation of dividing the values of KW _i by the values is performed , determining the values of the efficiency of information transfer η _i of each i-th route, which from the output of divider 7 are fed to input 1 of comparison circuit 8, to input 2 of which the current minimum value of the efficiency of information transfer is fed from output 2 of storage device 5.2. Since initially in storage device 5.2 the value and information about the current optimal route are absent, then the value η _i , from output 1 of comparison circuit 8, is immediately fed to “control input 1” of storage device 5.2, where it is stored , and also remember information about the current optimal route . In subsequent calculations in the divider 7, the values of η _i in the comparison circuit 8 are compared with the value , and if , then the value η _i from its output 1 is fed to “control input 1” of the memory device 5.2. Based on the signal to “control input 1” of the memory device 5.2, the value is stored (updated) and the current optimal route . Then, in the comparison circuit 8, a signal is formed and sent from its output 2 to the “control input” of the measuring-calculating unit of all possible routes from the sending node to the receiving node 1, including in the event that the condition is not met in comparison circuit 8. At the signal to "control in" of the block of the meter-calculator of all possible routes from the sender node to the recipient node 1, information about the current i-th route L _i is deleted and the presence of information about other possible routes is checked. If the block of the meter-calculator of all possible routes from the sender node to the recipient node 1 has information about another possible route, then from its output 1, information about the next current i-th route L _i is output to the inputs of storage devices 5.2 and 5.4. If there is no information about other possible routes in the block of the meter-calculator of all possible routes from the sender node to the recipient node 1, a signal is formed and sent from its output 2 to "control in 2" of storage device 5.2. At the signal to "control in". 2» of the storage device 5.2 to its output 1, which is the output of the device, provide information about the optimal route between the sending node and the receiving node. Then, after Δt _, the memory device 5.2 is reset ("set 0"). After which the above measurements and calculations are continued.

Thus, the operation of the device for determining the optimal route for transmitting information in the communication system is fully implemented.

As a result of the device operation, a signal is formed at its output with information about the optimal route from the sender node to the recipient node according to the criterion of the minimum value of the efficiency of information transmission from all possible routes from the sender node to the recipient node. The signal from the device output can be displayed, for example, on typical display devices using microcontrollers [Prokopenko B.S. Programming ATMEL microcontrollers in the language of S. St. Petersburg: Korona-Vek, 2012, pp. 286-298].

Claims (1)

A device for determining the optimal route for transmitting information in a communication system, comprising a measuring-calculating unit of all possible routes from a sending node to a receiving node (1), characterized in that the following are additionally introduced: a first group of counters (2.1.M), a first group of dividers (3.1.M), connected in series according to the number M of intervals of the communication system, to the second inputs of which the values of a given measurement time interval Δtset _{are fed} , a first group of multipliers (4.1.M), a first storage device (5.1), a first adder (6.1), a divider (7), a comparison circuit (8), a second storage device (5.2), the first output of which is the output of the device; also additionally introduced are a second group of counters (2.2.M), a group of adders (9.M), a second group of dividers (3.2.M), connected in series according to the number M of intervals of the communication system, to the second inputs of which the values of the number of measurements n are fed, and the outputs of the second group of dividers (3.2.M) are connected to the second inputs of the first group of multipliers (4.1.M); in addition, additionally introduced are a fourth memory device (5.4) and a second group of multipliers (4.2.M), connected in series according to the number M of intervals of the communication system, a third memory device (5.3), a second adder (6.2), the output of which is connected to the second input of the divider (7); the first output of the fourth memory device (5.4) is connected to the control inputs of the first (5.1) and third (5.3) memory devices, and the second output of the fourth memory device (5.4) is connected to the control inputs of the first (6.1) and second (6.2) adders; the first output of the block of the meter-calculator of all possible routes from the sender node to the recipient node (1) is connected to the inputs of the second (5.2) and fourth (5.4) storage devices, and the second output of the block of the meter-calculator of all possible routes from the sender node to the recipient node (1) is connected to the second control input of the second storage device (5.2), the second output of which is connected to the second input of the comparison circuit (8), the second output of which is connected to the control input of the block of the meter-calculator of all possible routes from the sender node to the recipient node (1).

Images