1. Un modelo de la teoria de colas con numero variable de canales.
- Author
-
Romaní, José
- Abstract
In this paper the author gives the state probabilities of the following queue model. The arrival and departure precess are at random with λ-mean arrival and μ=mean servicing time in a single channel. The number of channels is in this model a random number depending upon the length of the queue; when the number of waiting units is M and it arrives another unit, the number of channels is increased in one, and this channel services the first unit in queue; when a channel is free and none unit being in queue, this channel es cancelled. Only in the case of the last channel this should be open. So we have the length of the queue is never greater than M. The notation used in the paper is: r=number of units in queue. s=number of channels (of number of elements being serviced). $$\rho = \frac{\lambda }{\mu }$$ P( r,s;t)=Probability of the state ( r, s) on time t. p(r s)=Probability of the state ( r, s) in the steady state of the model. With this notation, we have This model includes as particular cases the model of a single channel, equivale to M-→∞ and the model of infinite channels, equivalent to M=0. [ABSTRACT FROM AUTHOR]
- Published
- 1957
- Full Text
- View/download PDF