Queueing Analysis: Finite systemsNorth-Holland, 1991 - Queuing theory |
Contents
Preface | 8 |
SemiMarkov Process I | 17 |
Output and QuasiInput Processes | 29 |
Copyright | |
9 other sections not shown
Other editions - View all
Common terms and phrases
A(V_ A(X_ arbitrary message arriving message B₂ blocking probability busy period process carried load dB(x defined denote elapsed service exhaustive service FCFS system following set G-limited idle period initial condition joint distribution Joint probability k messages Laplace transform LCFS limited service system M/G/1/K system Markov chain mean length mean number mean waiting messages arrive messages served messages that arrive msisk multiple vacation model number of messages obtain P₁ Pk(x Po(t Prob Prob[A(V_ Prob[L pushout queue size distribution remaining service remaining vacation semi-Markov process server is busy server vacations service completion service facility service period set of equations setup single vacation model steady-state Substituting successive Markov points system is given throughput time-dependent process Κλ λ λ λ Σ λη λχ Πο Πρ Σ ακ Σ π Σ Σ Σα Σπ