SU1453413A1 - Arrangement for simulating mass service systems - Google Patents

Abstract

The invention relates to computing and can be used to simulate a multi-channel queuing system with failures. The purpose of the invention is to expand the functionality of the device by modeling. probabilistic distribution of applications between service channels by request. this law. This is achieved by introducing into the device a generator of a random stream of pulses; bans, a switch, a group of memory registers, a group of transducers code — the intensity of a stream of pulses, a group of prohibition elements, the first and second elements AND, the register of incompatible events, and the counter of unserved requests. 3 il. § W

Description

.

The invention relates to computing and can be used to simulate a multi-channel queuing system with failures.

The purpose of the invention is to expand the functionality by simulating the probability distribution of the gap between service channels according to a given law. A: FIG. 1 shows the structural: device heme; in fig. 2 - switch block diagram; FIG. 3 is a block diagram of the register of incompatible random events (bits). The device contains a source 1 of the input stream of the order, generators 2 of a random stream of pulses,

Ti A, -

N

  Ah., I 1, N case 10

streams of pulses.

using the appropriate converters 5, the code — the intensity of each output stream Ti ;, 1 1, N of switch 4 is transformed into a random stream of rt-pulses with intensity LH; G -2, where X, is a H-bit

the binary code in the ith register of group 6.

Let at the initial moment of time all the service channels of the group 10) 5 be free. The free state of any channel corresponds to the zero level of the signal at its output, so all the element BAN .7 is open for the passage of streams to the corresponding: Banning element 3, switch 4, group-20 “” inputs of register 8. Pervyuy by converters 5 code - intensity - pulse flow fivnity, group 6)) Memory registers, group BAN 7, register 8 inconsistent events, group 9, 9, group 25 at 10 service channels, counter 1 unattended quotations, second element ijieHT And 12, first Element And 13. Switch 4 contains the element $ APRET 14, tachik 15, demultiplexer sore 16 and generator 17 pulses. At l1, the high frequency of the generator is 17 fp- (4 ... 5), where-7 0 is the intensity of the random input pulse flow of the geyrator 2, the counter state is 15 33 The polling moments of the demultiplexer are independent and equally distributed, which ensures the separation of the input flow. Lift independent pulse flows with (Identical intensities.

The element BAN 14 serves to exclude the cases of splitting pulses with flow at the outputs of the switch 4 "

Register 8 contains the triggers 18 and the elements OR 19.

Each service channel of the group 10 is a time-setting 1 (|) device and can be made as a random time delay block.

The device works as follows.

Random flow 7i, pulses from the generator 2 output. In the absence of pulses from behind the wok, the BANCH 3 element is fed to the input of the compiler 5. Lator 4, at the outputs of which the stream of pulses is divided into N independent and equal in intensity 35

40

45

50

The occurrence of a pulse from a set of threads translates the corresponding bit (trigger) of register 8 into 1 and resets the bit that precedes the point in time (trigger) to every subsequent pulse of any other flow. As a result, in the register 8 the discrete Markov process is reproduced with non-coincident time and N states, described by the matrix of unconditional transition intensities (the intensities in the columns of the matrix are the same)

At the outputs of register 8, a full group of orthogonal random binary signals with vectors is formed.

I ,. -Ji

PI N

jcT

Random binary signals with parameters p. are controllable for appropriate elements AND 9, to the first inputs of which impulses are received from source 1 When performing conditional N .j, where the flow rate of the source 1, the elements 9 are implemented random independent tests, the outcome of which is Random events that involve passing the request of source 1 to the i-th free service channel in accordance with a predetermined discrete probability distribution.

Assume that the first source application, 1, was received at the input of the service channel, then the signal to

Ti A, -

N

  Ah., I 1, N case

streams of pulses.

using the appropriate converters 5, the code — the intensity of each output stream — Ti ;, 1 1, N of switch 4 is transformed into a random stream of rt-pulses with intensity LH; G -2, where X, is a H-bit

the binary code in the ith register of group 6.

Let at the initial moment of time all the service channels of group 10 be free. The free state of any channel corresponds to the zero level of the signal at its output; therefore, all the element BAN .7 is open for the passage of streams to the corresponding inputs of register 8. First of all

five

five

0

five

0

The occurrence of a pulse from a set of threads translates the corresponding bit (trigger) of register 8 into 1 and resets the bit that precedes the point in time (trigger) to every subsequent pulse of any other flow. As a result, in the register 8 the discrete Markov process is reproduced with non-coincident time and N states, described by the matrix of unconditional transition intensities (the intensities in the columns of the matrix are the same)

At the outputs of register 8, a full group of orthogonal random binary signals with vectors is formed.

I ,. -Ji

PI N

jcT

Random binary signals with parameters p. are controllable for appropriate elements AND 9, to the first inputs of which impulses are received from source 1 When performing conditional N .j, where the flow rate of the source 1, the elements 9 are implemented random independent tests, the outcome of which is Random events that involve passing the request of source 1 to the i-th free service channel in accordance with a predetermined discrete probability distribution.

Assume that the first source application, 1, was received at the input of the service channel, then the signal to

314

the output of the service channel takes the value 1 and closes the corresponding BAN member 7. At the time interval between the first and second applications of source 1 in register 8, a discrete Markov process is reproduced with a smaller by one number of states equal to the number of free service channels in the body. 10. Therefore, the choice of the free service channel of the second application of source 1 is carried out in accordance with the specified / 1 discrete probability distribution / reduction by one position p., I 1, N-1, i.e. while maintaining the specified relative priority of channels.

Similar operation of the device on the interval between the second and third,

third and fourth etc source 1, provided that none of the occupied channels was released. The release of any service channel, after service time per service, leads to an increase in the number of register bits 8 involved in the formation of the Markov process, and consequently, an increase in the number of outcomes when conducting tests on choosing a free channel using elements 9 In the case when all the service channels are occupied, on the output of the element And 12 there is 1, which consists of the element And 13 for counting 11 of the number.

To increase the reliability of the selection process with the help of ZA-PRET 7 elements of the free service channel, the prohibition element 3 is used. It turns off by sending an impulse to its inverse input and changing the state of the register 8, and therefore 9 for the duration of the impulse passing into the free service channel.

Claims (1)

Invention Formula A device for simulating a queuing system comprising an input source of the application, a group of And elements and a group five 0 five . 0 c about d 0 13 service channels of the order, made in the form of blocks of random time delay, the inputs of which are connected respectively to the outputs of the elements AND groups, in order to extend the functionality by simulating the probability distribution of the applications between the service channels to a given law, it additionally contains a counter of the unobserved orders, the first and second elements AND, a group of memory registers, a generator of a random stream of pulses, a prohibition element, a group of prohibition elements, a switch Ator, transducer group code - pulse flow intensity and register of incompatible events, the bit inputs of the register of incompatible events are connected respectively to the outputs of the group inhibit elements, and the bit codes of the register of incompatible events are connected respectively to the first inputs of the And group elements, the second the inputs of which, the first input of the first element AND and the control input of the prohibition element are connected to the input stream source of the input, the information input of the prohibition element is connected to. the output of the random pulse generator, and the output of the inhibit element is connected to the information input of the switch, the outputs of which are connected respectively to the information inputs of the converters code - the intensity of the flow of pulses of the group, the installation inputs of which are connected respectively to the bit outputs of the memory registers of the group, the outputs of the code converters are the intensity the pulse flow of a group is connected respectively to the information inputs of the group inhibiting elements, and the control inputs of the inhibiting elements the groups are connected respectively to the outputs of the random time delay block of the service channel group and the inputs of the second element I, the output of which is connected to the second input of the first element I, the output of which is connected to the counting input of the counter of unserved connections.