Communication network analyzer

FIELD: technology for solving network analysis problems provided by probability graphs.

SUBSTANCE: device contains clock impulse generator, cycle counter, input field, group of AND elements, output counter block, delay element, AND element, OR element, control signal block, second AND elements, pseudo-random series generators, pseudo-random series generators, pseudo-random series generators.

EFFECT: expanded functional capabilities due to modeling of various communication channel conditions, increased trustworthiness of results due to modeling of various types of failures of communication units in process of operation.

2 dwg

 

The invention is intended to solve problems of network analysis, we present a probabilistic graphs, in particular, it allows to determine the probability of the existence of links between any input and any output elements of the considered probabilistic network, as well as to simulate network failures of various types.

The device allows to determine the structural reliability (probability of health) complex branching systems, structural reliability schemes which cannot be represented in the form of a parallel-series connection of elements. Such systems are represented by a set of simple operational States, each of which includes a minimum number of system elements necessary to ensure this operating state, and can be identified by simple count of the network.

It is known device [1], comprising a shift register, block, And block-busting combinations, the first group of registers, the group of items, group of items OR block allocation units, the group of blocks of elements And the second group of registers, the third element OR block multiplication, buffer register, the adder, the second trigger, the first trigger, the trigger mark, second, third, fifth, fourth, the first elements And the first, second elements are NOT, second, first, fourth elements OR PE is new, the second, third, and fourth elements of the delay switch, input, output devices.

It is also known device [2], which contains the definition block of adjacent vertices of the graph, group of items OR a group of counters, the matrix of generators of random events, the second group of elements OR inputs survey of graph vertices device that outputs an indication of the connectivity of the vertices of the graph.

However, both of these devices allow you to simulate the network with absolutely reliable branches (links), when modeling the vertices of the network (nodes) are formed failures of the same type.

Closest to the claimed device principle of operation and the technical implementation is a probabilistic device for analyzing networks [3], adopted for the prototype, containing a generator of clock pulses, the counter cycles, inlaid box, a block of output counter, the block of code converters-the probability of an item OR element of the delay elements And the terminals of the diode bridge, the output counters, converters, pseudorandom number generator, digital Comparators, registers.

However, the device-prototype also allows to simulate the network with absolutely reliable branches (links), when modeling the vertices of the network (nodes) are formed failures of the same type.

The technical result of the proposed device is the functional extension is x capabilities of the device by simulating various state branches (channels of communication) communication network, as well as increasing the reliability of the obtained results by simulating different types of failures of vertices (nodes) of the communication network in operation.

The technical result is achieved in that in a device comprising a generator of clock pulses, the counter cycles, composition field, the group of items, a block of output counters, delay element, element, element, OR each of the output groups outputs dialer field is connected to the first input of the element And the group, the output of which is connected to the same input group input blocks output counter input clock is the input of the device is started, the generator output clock pulses connected to the first input element And the output of which is connected to the input of the delay element and to the subtractive input of the cycle counter, and the second input element And is connected to the output element OR group of inputs of which are connected with a group of bit outputs of counter cycles, the output of delay element connected to the second inputs of elements And groups have been added to the block control signals, the second elements 1,...,N, the generators of pseudorandom sequence 1 (gpsa-1) 1,...,N, the generators of pseudorandom sequence 2 (gpsa-2) 1,...,N, the generators of pseudorandom sequence 3 (gpsa-3) 1,...,K, the output element And is connected to the information inputs GPSA-1 1,...,N, Gpsa-2 1,...,N and gpsa-3 1,...,K, outputs gpsa-1 and gpsa-2 connected respectively to first and second inputs of the second elements 1,...,N, the outputs are connected to inputs of artificial fields, outputs gpsa-3 1,...,K are connected to the inputs of artificial fields, data bus block control signals connected to the inputs of the data gpsa-1, gpsa-2 and gpsa-3, while the composition field is the adjacency matrix of the graph of the studied network, diagonal elements which are the elements And off-diagonal elements are pairs of terminals, the input elements are the inputs of artificial fields, and the outputs of the elements are the outputs of the artificial field, the inputs of the first element And connected between a second input of the k-th element, And k=2, 3...N, through a pair of terminals forming the elements of the adjacency matrix above the diagonal, is connected to the outputs of the j-th elements of And, where j=1, 2...k-1, the output of the j-th item, And where j=2, 3...N through a pair of terminals forming the elements of the adjacency matrix below the diagonal, is connected to the second inputs of the k-th elements And, in addition, the connection of each pair of terminals is made elements And the input elements are connected to the outputs of the elements of the adjacency matrix, and the second inputs are relevant To the inputs of the artificial field.

The proposed device allows you to simulate the three types of failures, most is characteristic is x for elements of communication networks [4, 5]:

sudden failures - failures, characterized by abrupt changes in the values of one or more parameters of the object;

gradual failures - failures that result from gradual changes in the values of one or more parameters of the object;

bounce branches (channels of communication), resulting from external influences.

The proposed device allows you to simulate failures and damage caused by external influences. Damage is the event consisting in the malfunction of equipment due to external influences. They result from the application of mechanical shocks, pressure changes, introduction of corrosive substances into the atmosphere, radiation, appearing at the inputs of the instrumentation electrical signals or voltages beyond tolerance. The resulting damage of malfunction can wear both General and local in nature, as determined by various characteristics of external influences. Their level (the magnitude of external effects) indicates the number of different hardware faults [5, p.7].

The analysis of the level of technology has allowed to establish that the analogues, characterized by a set of characteristics is identical for all features of the claimed technical solution is available, which shows the compliance of the claimed invention to condition patentability of "novelty."

Search results known solutions in this and related areas of technology in order to identify characteristics that match the distinctive features of the prototype of the features of the declared object, showed that they do not follow explicitly from the prior art. The prior art also revealed no known detection provided the essential features of the claimed invention transformations on the achievement of the technical result. Therefore, the claimed invention meets the condition of patentability "inventive step".

The claimed device is illustrated by drawings on which is shown:

figure 1 - structural diagram of the device;

figure 2 - composition field;

figure 3 - algorithm of digital signal processing.

The analyzer communication networks (figure 1) includes: a generator of clock pulses (GTI) 1, count 2, inlaid box 3, a block of output counter 41,...,4N, item, OR 5, the And gate 6, the delay elements 7, elements, And group 81,...,8Nelements And 9, the terminals 10, the elements And 111,...,11Nthe block of digital signal processing 12, the block control signals 13, gpsa-1 141,...,14N, Gpsa-2 151,...,15N, Gpsa-3 161,...,16Nsecond elements 171,...,17N. Each output groups outputs dialer field 3 connected to the first input of agnomen the element And group 8 1,...,8Nwhose output is connected to the same input group input blocks output counter 41,...,4Nthe generator input clock 1 is the input of the device is started, the generator output clock 1 is connected to the first input of the first item And 6, the output of which is connected to the input of the delay element 7 and to the subtractive input of the cycle counter 2, and the second input element And 6 connected to the output of the OR element 5, the group of inputs of which are connected with a group of bit outputs of counter cycles 2, the output of the delay element 7 is connected with the second inputs of elements And groups 81,...,8Nthe output of the first item And 6 are connected to information inputs gpsa-1, gpsa-2 and gpsa-3, the outputs gpsa-1 and gpsa-2 connected respectively to first and second inputs of the second elements And 171,...,17Nthe outputs are connected to inputs of artificial fields, outputs gpsa-3 1,...,K are connected to the inputs of artificial fields, data bus block control signals connected to the inputs of the data gpsa-1, gpsa-2 and gpsa-3, while the composition field is the adjacency matrix of the graph of the studied network, the diagonal elements of which are the elements And off-diagonal elements are pairs of terminals, the input elements are the inputs of artificial fields, and the outputs of the elements are the outputs of the artificial field, the inputs of the PE the first element And interconnected the second input of the k-th element, And k=2, 3...N, through a pair of terminals forming the elements of the adjacency matrix above the diagonal, is connected to the outputs of the j-th elements of And, where j=1, 2...k-1, the output of the j-th item, And where j=2, 3...N through a pair of terminals forming the elements of the adjacency matrix below the diagonal, is connected to the second inputs of the k-th elements And, in addition, the connection of each pair of terminals is made elements And the first the input elements are connected to the outputs of the elements of the adjacency matrix, and the second inputs are relevant To the inputs of the artificial field.

Composition field 3 (figure 2) represents the adjacency matrix of the graph of the studied network, the diagonal elements of which are the elements And 9, the off-diagonal elements of the pair of terminals 10, the connection of which elements And 11 corresponds to the unit matrix, adjacency, nesoedinimye - zero. Example enable jumper element 11 shown in figure 2 for a node in the graph (1, 2). First the inputs and outputs of the elements And 9 are respectively the inputs and outputs of the artificial field. The inputs of the first element And 9 are interconnected. The second input of the k-th item, And 9 (k∈|2, 3...N|) through a pair of terminals 10, forming the elements of the adjacency matrix above the diagonal, is connected to the outputs of the j-x elements And 9 (j=1, 2...k-1), the output of the j-th item, And 9 (j∈|2, 3...N|) through a pair of terminals 10, forming the elements of the matrix cm is gnosti, below the diagonal, is connected to the second inputs of the k-th elements And 9. The jumper element 11 is connected to terminals 10, the first inputs of elements And 11 are connected to the outputs of the elements And 9, and the second inputs are inputs 1,...,To dial field.

The pseudo-random sequence generator 1 141,...,14Nis designed to generate a pseudo-random sequence, describing the sudden failures of vertices (nodes) of the network connection.

The pseudo-random sequence generator 2 151,...,15Nis designed to generate a pseudo-random sequence, describing the gradual failure of vertices (nodes) of the network connection.

The pseudo-random sequence generator 3 161,...,16Kis designed to generate a pseudo-random sequence that characterizes the failure branches (channels of communication) communication network, resulting from external influences.

Schema gpsa-1, gpsa-2 and gpsa-3 are known and described, for example, in the book: Alferov A.P., Teeth, A., Kuzmin, A.S., Cheremushkin AV Cryptography. - M.: Helios ARV, 2001, str, 36 [6].

The second And gate 17 is designed to priklucheniya pseudo-random sequence to the inputs of artificial fields. His scheme is known and described, for example, in the book: Tokheim R. fundamentals of digital electronics: TRANS. from English. - M.: Mir, 1988. - 392 S., ill., p.48, ri is.3.2 [7].

Element And 11 is designed for the switching elements of the probabilistic network. His scheme is known and described, for example, in the book: Tokheim R. fundamentals of digital electronics: TRANS. from English. - M.: Mir, 1988. - 392 S., ill., p.48, fig.3.2 [7].

Gpsa-1 141,...,14N, Gpsa-2 151,...,15N, Gpsa-3 161,...,16Kblock control signals 13, the second And gate 171,...,17Ntechnically you can implement in the form of systems digital signal processing (DSP) 12, based on the microprocessor. This gpsa-1, gpsa-2 and gpsa-3 are implemented in software using a persistent storage device (ROM programs) system CSO. In the ROM stores the elements of the pseudo-random sequence, which at the command of the CSO system loaded in the system.

The principle of operation of the CSO system is described in many sources. The closest in technical essence is the CSO system, described in the book Ali "Digital processing of signals TMS 32010 and its application," published by the Military Academy of communications, Leningrad, 1990, p.102-109, RES [8].

Instead of the detailed disclosure of meaningful implementation of the CSO system will give the block diagram of the implemented their algorithm works, for example in the form presented in figure 3. This information is enough to block its implementation, as in this case on the th block-diagram can be produced programming known system CSO using known methods.

The device operates as follows.

Composition field 3 displays the count of the investigated probabilistic network by connecting jumpers, lockable elements AI, pairs of terminals 10, the respective single elements of the adjacency matrix of the graph network. The outputs of the elements And 9, the corresponding output links of the network are connected to first inputs of elements And 111,...,11Nand second inputs connected to the outputs gpsa-3. In each i-th register gpsa-1 141,...,14N, Gpsa-2 151,...,15N, Gpsa-3 161,...,16Kwrites the value of the probability of the existence of the i-th vertex of the network. Output counters 41,...,4Nare set to "0". In the 2-cycle counter write the code number of the planned experiments. The beginning of the operation of the device is performed upon receipt of the signal at the input of the device's launch, allowing the passage of clock pulses from the GTI 1 through the element And 6 to the input of counter 2 cycles and at the inputs of gpsa-1, gpsa-2 and gpsa-3.

Upon receipt of the next pulse at the inputs of gpsa-1 141,...,14Non its outputs generated pseudo-random sequence, the distribution of which corresponds to the sudden failures of vertices of the network. Upon receipt of the next pulse at the inputs of gpsa-2 151,...,15Non its outputs generated pseudo-random sequence, samorazdrazheniya which corresponds to the gradual failure of the vertices of the network. Upon receipt of the next pulse at the inputs of gpsa-3 161,...,16Kon its outputs generated pseudo-random sequence, the distribution of which corresponds to a failure of the branches of the network resulting from external influences. The formation of a pseudo-random sequence with an arbitrary distribution law is made by the method of Neuman [9]. Formed in gpsa-1 and gpsa-2 sequence are received at first and second input elements And 171,...,17Nrespectively. From the outputs of the elements And 171,...,17Nthe sequence received at the first inputs of the i-th cell And 9, and the signal is maintained throughout elementary loop simulation. Formed in gpsa-3 sequence received at the second inputs of elements And 111,...,11N. So, using the gpsa in each of the static experiments graph is formed, which may exist or may not be the path from the source graph to each connected to the output of counter 4 vertices. If such path at the first sign of the corresponding element And 8 will allow potential, and delayed by the delay element 7, the pulse arrives at the input of the counter 4 positive outcomes; in the absence of the way on the first input element And 8 of the enabling potential will not be, and such pulse from the GTI 1 in the counter 4 is not the settlement is upit.

With the formation of each pulse GTI 1 is the subtraction of the contents of the counter 2 cycles. Then the described process is repeated. When the content of the counter 2 becomes zero, the output element OR 5 appears potential prohibiting the passage of clock pulses from the GTI 1 through item 6.

The device works according to the following algorithm (figure 3).

Getting started system CSO is to set the value of the received bit sequence of V0 (n=1). The value of the received bit sequence is recorded in the registers of the gpsa. Is the data input: n - the current value of the bits of the SRP, and the parameter of the distribution law of a random variable. In the next step gpsa generate 2 sequences ξ1and ξ2uniformly distributed in the interval [0, 1]. Next is the selection of pairs of values (ξ1that ξ2). The condition of a·Pη1)≥ξ2. When coincidence is the formation of a pseudo-random sequence with a given distribution law Pη(x). Otherwise, generation ξ1and ξ2repeats again. Enter values as produced by the data bus from the block control signals. Thus, it is possible to adjust the parameters of the distribution of the random is isel in each of gpsa-1, Gpsa-2 and gpsa-3. The next step is writing values pseudorandom sequence gpsa-1 and gpsa-2 to the inputs of the elements And. Read values pseudo-random sequence from the outputs of the elements And is made through the outputs D1,...,DN system CSO on N inputs dialer field. Reading the values of the pseudo-random sequence with outputs gpsa-3 is made through the outputs V1,...,VK system CSO on To the inputs of the artificial field. The algorithm is fully implemented.

Thus, the technical result is achieved by modeling the different States of the branches (channels of communication) communication network, and increase the reliability of evaluation of the obtained results is performed by simulating different types of failures of vertices (nodes) of the communication network in operation.

Evaluation of the effectiveness of the proposed device was made by comparing the reliability evaluation of the results obtained in the simulation process failures of the same type for existing devices and for modeling failures of three types for the proposed device.

From the formula 11.8.6, str [10]:

where f is the function Laplace;

N is the number of simulated events;

POsh- the real value of the evaluation;

- desired value;

ε - led is in the confidence interval.

Determine the reliability assessment of the technical state of a complex system, taking:

Move on from the function of the Laplace its argument [11]:

Then:.

For the case when ROsh,can not be calculated, you can use the simplified formula for the worst-casethen:

Then, we define tα1and tα2taking ε=0,05, N=1 for the prototype (in the simulation of failures of the same type) and N=3 for the claimed device (for modeling failures of three types):

Thus, it is possible to evaluate the effectiveness of the claimed device:

Sources of information

1. Patent "Device for calculating the characteristics of graphs". Auth. St. USSR №1244673, G06F 15/20, 1986.

2. Patent "Device for operations on the graph". Auth. St. USSR №1462349, G06F 15/20, 1989.

3. The patent for the invention "a Probabilistic device for analyzing networks". Auth. St. USSR №1256040, G06F 15/20, 1986.

4. GOST 27.002-89. Reliability in engineering. The basic concepts. The terms of the definition.

5. The priest S. p. fundamentals of technical diagnostics and communication systems and automation control. - L.: YOU, 1989, 192 S.

6. Alferov A.P., Teeth, A., Kuzmin, A.S., Cheremushkin AV Cryptography. - M.: Helios ARV, 2001.

7. Tokheim R. fundamentals of digital electronics: TRANS. from English. - M.: Mir, 1988. - 392 C., Il.

8. Lane A. A. Digital processor processing signals TMS 32010 and its application. - L.: YOU, 1990

9. The Golenko DI Modeling and statistical analysis of pseudorandom numbers on electronic computing machines. - M.: Nauka, 1965

10. Wentzel Y.S., Ovcharov L.A. probability Theory and its engineering applications. - M.: Nauka. CH. nat. Ed.-Mat. lit. - 1988, 480 S.

11. Ivanov E.V. simulation tools and communication systems and automation. SPb.: YOU, 1992, 206 S.

The analyzer communication networks, comprising a generator of clock pulses, the counter cycles, composition field, the group of items, a block of output counters, delay element, element, element, OR each of the output groups outputs dialer field is connected to the first input of the element And the group, the output of which is connected to the same input group input blocks output counter input clock is the input of the device is started, the generator output clock pulses connected to the first input element And the output of which is connected to the input of the delay element and to the subtractive input of the cycle counter, and the second input element And is connected to the output element OR group of inputs of which are connected with a group of bit outputs of counter cycles, the output of delay element connected to the second inputs of elements And groups, characterized in that it further introduced the block control signals, the second elements 1,...,N, the generators of pseudorandom sequence 1 (gpsa-1) 1,...,N, the generators of pseudorandom sequence 2 (gpsa-2) 1,...,N, the generators of pseudorandom sequence 3 (gpsa-3) 1,...,K, the output element And connected to information inputs gpsa-1 1,...,N, gpsa-2 1,...,N and gpsa-3 1,...,K, outputs gpsa-1 and gpsa-2 connected respectively to first and second inputs of the second elements 1,...,N, the outputs are connected to inputs of artificial fields, outputs gpsa-3 1,...,K are connected to the inputs of artificial fields, data bus block control signals connected to the inputs of the data gpsa-1, gpsa-2 and gpsa-3 when this composition field represents the adjacency matrix of the graph of the studied network, the diagonal elements of which are the elements And off-diagonal elements are pairs of terminals, the input elements are the inputs of artificial fields, and the outputs of the elements are the outputs of the artificial field, the inputs of the first element And connected between a second input of the k-th element, And k=2, 3...N, through a pair of terminals forming the elements of the adjacency matrix, R is polozhenie above the diagonal, connected to the outputs of the j-x elements, And where j=1, 2...k-1, the output of the j-th item, And where j=2, 3...N through a pair of terminals forming the elements of the adjacency matrix below the diagonal, is connected to the second inputs of the k-th elements And, in addition, the connection of each pair of terminals is made elements And the input elements are connected to the outputs of the elements of the adjacency matrix, and the second inputs are relevant To the inputs of the artificial field.



 

Same patents:

FIELD: engineering of systems for finding events and notifying query programs, registered for such notification.

SUBSTANCE: device for notifying about events contains a set of query means, a set of notification means, card means, means for controlling notifications. Method for notifying about events includes receiving a set of requests for event registration, each one of which originates from query program, each registration request contains first identifier, identifying query program, and second identifier, identifying one of notification programs, storage of identifiers in card and activation of notification program, identified in card, access to card for identification of all query programs, from which registration requests were received, activation of identified query programs and transfer to each of them of representation of event that occurred. Stored on machine-readable carrier are commands, which direct computer to realize aforementioned method.

EFFECT: expanded functional capabilities.

5 cl, 4 dwg, 3 tbl

FIELD: computer engineering; two-dimensional and three-dimensional images processing problem.

SUBSTANCE: device consists of processor matrix, control unit, rotation junction, pressure junction, memory junction matrixes, commutation unit, volume detection junction, and code former. Additional informational input is introduced in the device in every matrix processor local memory input commutator, memory junction matrix, additional pressure junction inputs, connected with processor matrix outputs, additional control unit outputs, connected with additional commutation unit inputs. For each k-th matrix control signal matrix collection of elements is divided into non-overlapping subsets; for each subset first cascade amplifier is introduced. The whole set of m-th cascade amplifiers is divided into non-overlapping subsets; for each m-th cascade amplifiers, excluding the last one, an m+1 cascade amplifier is introduced, output of which is connected with input of every amplifiers of m-th cascade; last cascade amplifiers inputs are connected with corresponding outputs of control unit.

EFFECT: increased speed and accuracy of two-dimensional and three-dimensional images processing.

56 dwg, 2 tbl

FIELD: computer science.

SUBSTANCE: device has matrix of m rows and n columns of homogeneous environment elements, block for finding maximum, adder, memory block, m blocks for counting units, block for estimation of channels load level, containing two pulse generators, two row selection decoders, unary value selection decoder, element selection decoder, element selection multiplexer, channel load decoder, two comparison elements, m channel load counters, two groups of m OR elements, two groups of m forbidding elements, current column counter, group of m AND elements, third group of m OR elements, two groups of m triggers, two row counters, two column counters, two OR elements, delay elements, counter of next column.

EFFECT: broader functional capabilities.

5 dwg

The invention relates to computing and is used when building the switching means multiprocessor computing and control systems, subscriber communication systems with decentralized management and information-measuring systems

The invention relates to the field of information security and, in particular, refers to the hardware and software components of firewalls are used to prevent unauthorized access and exchange of information between the various subscribers of computer networks

The invention relates to the field of computer engineering and can be used in automated control systems

The invention relates to computing and can be used to build high-performance computing systems to solve problems, algorithms that can be parallelized at the level of teams

The invention relates to the field of computer engineering and can be used to build a switching means multiprocessor computing and control systems

The invention relates to computing and can be used to estimate the state of an object by several parameters in the fuzzy set degree of membership of the possible options given the state of the object

FIELD: technology for solving network analysis problems provided by probability graphs.

SUBSTANCE: device contains clock impulse generator, cycle counter, input field, group of AND elements, output counter block, delay element, AND element, OR element, control signal block, second AND elements, pseudo-random series generators, pseudo-random series generators, pseudo-random series generators.

EFFECT: expanded functional capabilities due to modeling of various communication channel conditions, increased trustworthiness of results due to modeling of various types of failures of communication units in process of operation.

2 dwg

FIELD: computer science.

SUBSTANCE: device has matrix of m rows and n columns of homogeneous environment elements, block for finding maximum, adder, memory block, m blocks for counting units, block for estimation of channels load level, containing two pulse generators, two row selection decoders, unary value selection decoder, element selection decoder, element selection multiplexer, channel load decoder, two comparison elements, m channel load counters, two groups of m OR elements, two groups of m forbidding elements, current column counter, group of m AND elements, third group of m OR elements, two groups of m triggers, two row counters, two column counters, two OR elements, delay elements, counter of next column.

EFFECT: broader functional capabilities.

5 dwg

FIELD: computer engineering; two-dimensional and three-dimensional images processing problem.

SUBSTANCE: device consists of processor matrix, control unit, rotation junction, pressure junction, memory junction matrixes, commutation unit, volume detection junction, and code former. Additional informational input is introduced in the device in every matrix processor local memory input commutator, memory junction matrix, additional pressure junction inputs, connected with processor matrix outputs, additional control unit outputs, connected with additional commutation unit inputs. For each k-th matrix control signal matrix collection of elements is divided into non-overlapping subsets; for each subset first cascade amplifier is introduced. The whole set of m-th cascade amplifiers is divided into non-overlapping subsets; for each m-th cascade amplifiers, excluding the last one, an m+1 cascade amplifier is introduced, output of which is connected with input of every amplifiers of m-th cascade; last cascade amplifiers inputs are connected with corresponding outputs of control unit.

EFFECT: increased speed and accuracy of two-dimensional and three-dimensional images processing.

56 dwg, 2 tbl

FIELD: engineering of systems for finding events and notifying query programs, registered for such notification.

SUBSTANCE: device for notifying about events contains a set of query means, a set of notification means, card means, means for controlling notifications. Method for notifying about events includes receiving a set of requests for event registration, each one of which originates from query program, each registration request contains first identifier, identifying query program, and second identifier, identifying one of notification programs, storage of identifiers in card and activation of notification program, identified in card, access to card for identification of all query programs, from which registration requests were received, activation of identified query programs and transfer to each of them of representation of event that occurred. Stored on machine-readable carrier are commands, which direct computer to realize aforementioned method.

EFFECT: expanded functional capabilities.

5 cl, 4 dwg, 3 tbl

FIELD: technology for solving network analysis problems provided by probability graphs.

SUBSTANCE: device contains clock impulse generator, cycle counter, input field, group of AND elements, output counter block, delay element, AND element, OR element, control signal block, second AND elements, pseudo-random series generators, pseudo-random series generators, pseudo-random series generators.

EFFECT: expanded functional capabilities due to modeling of various communication channel conditions, increased trustworthiness of results due to modeling of various types of failures of communication units in process of operation.

2 dwg

FIELD: computer engineering, possible use for creating multi-processor multi-thread computers.

SUBSTANCE: method for organization of multi-processor computer includes parallel execution of a thread of computations by means of distributed representation of thread descriptor stored in virtual memory, execution of primary selection of architecture commands by means of thread monitors, generation of graph for information dependencies of transactions, which are serially outputted through network into execution clusters, active thread is transferred to resident queue of transactions awaiting completion and next active thread is selected, by sequencers of execution clusters transactions are received and their commands and aforementioned graph are copied to registry file of cluster, execution-ready commands are copied to priority-ordered secondary selection queues, aforementioned selection and transfer of complete commands to the cluster are performed, graph is corrected based on these, on basis of correction results, the finalized command is added to either secondary selection queue or transaction completion result is transferred to monitor, thread is moved to queue for completed threads with correction of thread descriptor representation root, where completed thread is removed from waiting queue, and completion reason is outputted as a result available for software analysis.

EFFECT: fully hardware-based realization of multi-program control over threads with priority-based exclusion with precision up to an individual command.

FIELD: physics; communications.

SUBSTANCE: invention relates to the authentication in communications. The method and device for speech encryption at cellular authentication in the extensible authentication protocol format is put forward.

EFFECT: providing of usual authentication and setting format in communications.

11 cl, 10 dwg

FIELD: physics, computing.

SUBSTANCE: invention relates to local area networks. The technical effect is the increase in the local area network quality by generating seven frame types, decrease in the quantity of frame types and overhead costs for the data packet (DP) transmission implementation, and provision of automatic network restoration from a failure/malfunction state when more than one master local area network stations (LNSs) appear in the network or the master LNS disappears from the network, correspondingly. The method of local area network operation with the data communication line with common access and centralised determinated message communication control based on their separation into DPs and the DP transmission in information frames between the addressed subscribers of all its LNSs is implemented using three types of control frames (CF1, CF2, CF3), an information frame (IF), and three types of response frames (RF1, RF2, RF3), CF1 containing the first start combination (SC1), a discriminator field, an individual LNS address field, an addressing modifier (AM), a control command (CC) field, and a monitoring bit; the difference of CF2 from CF1 is the contents of the CC field and the presence of a service word following the CC field; CF3 contains SC1, a discriminator field, an individual DP recipient address field, an individual DP sender address field, a DP length field, an AM, a communication method modifier (CMM), and a monitoring bit, the IF contains the second start combination, a DP field, and a resolvable checksum word, RF1 contains SC1, a discriminator field, an LNS status word, and a monitoring bit, the difference of RF2 from RF1 is the presence of a service word following the LNS status word field, RF3 is CF1 or CF2 or CF3 with inversed values of bits in the discriminator field.

EFFECT: increase in local area network quality, decrease in quantity of frame types and overhead costs for implementation of data packet transmission, and provision of automatic network restoration in event of malfunction.

FIELD: physics.

SUBSTANCE: invention pertains to the field of increasing information security in computer networks, in particular to the system of preventing intrusion into network servers. The filter (302) for analysing incoming commands processes commands directed to the web-server, through comparison with a previously entered set of commands for the web-server, which are stored in comparison tables. Intercepted commands for which no correspondence is found during comparison with the previously entered commands are deleted. In that case the intercepted commands are not transmitted to the web-server. The system can contain extra algorithms for recursive checking of files in catalogues, located lower than the root directory of the web-server, as well as means of monitoring web-server resources and lowering of the level of use of the web-server resources when the last threshold value is exceeded.

EFFECT: protection of data of the web-server.

32 cl, 7 dwg

FIELD: physics, computer equipment.

SUBSTANCE: invention is related to automatics and computer equipment and may be used in building of distributed systems of program control of technological processes, robots and robotic complexes, and also subsystems of logical control of multilevel hierarchical automated control systems and multiprocessor systems of wide class. Device contains M*N single-type modules, which are combined into matrix structure, where N - number of modules in line of network matrix structure, M - number of lines, at that every module of microcontroller network includes unit of program memory, address register, register of commands, multiplexer of logical conditions, address commutator, unit of synchronisation, elements OR, register of match vector, buffer register, decoders of synchronisation top number, unit of OR elements, univibrators, delay element, group of synchronisation control module units, multiplexer of synchronisation channels, register of configuration, multiplexers, decoder of synchronisation channels, generator of synchronisation control signals, two groups of AND elements.

EFFECT: expansion of microcontroller network application by lower complexity of intermodule interface.

4 cl, 10 dwg

FIELD: information technology.

SUBSTANCE: system of digital media in a computer network consists of massive servers for the adaptation of streams of content of the provider (computer-aided manufacturing system), appropriating IP addresses of a computer network, access to which is possible through many network terminals (STB or personal computers), containing a player of content, the module of demand of the content is connected with the servers of administration of access of the subscriber in the local computer network and the server giving session keys for the protection of the operating words of the provider. By means of the SK on the CAM system controlled by the computer network, encoding CW by means of which the content of the provider is protected, placed further in rights usage management a stream of the content, further the control of access over network terminals (CT) is organised for the subscribers to the IP addresses appointed for adapted streams of content of the provider, by control facilities and configuration. In this case to realise the flexibility according to the tariff plans not achievable with the use of the chip of cards of conditional access of extended CAS.

EFFECT: possibility of relaying of the protected content by the provider in a computer network with the retention of control over subscribers from the side of the provider of the content.

60 cl, 3 dwg

Up!