Introduction to Queueing Theory |
Contents
PROBLEMS OF THE THEORY OF QUEUEING PROCESSES | 1 |
3 | 18 |
4 | 25 |
Copyright | |
9 other sections not shown
Other editions - View all
Common terms and phrases
a₁ absolutely continuous analytic arbitrary assumption busy period constant customer arrives customer stream defined determined distribution function ergodic distribution event exists exponentially distributed F₁ F₂ finite given instant h₂ Hence i-th incoming stream interval of length j-th L-process Laplace transform Laplace-Stieltjes transform Let us assume Let us consider Let us denote machines Markov chain Markov process mathematical expectation method Monte Carlo method nonnegative number of customers obtain occur P₁ P₂ parameter piecewise-linear Poisson stream problem process v(t proof proved queueing systems queueing theory recurrence relations reliability theory renewal process satisfied semi-Markov process sequence server is free servers are busy serving system simple stream single-server system solution stationary stream Stieltjes transform stochastic process stream without aftereffects subsection t₁ t₂ tion total probability formula transition units V₁ vector Veroyatnostei x₁ zero