Queueing Systems: TheoryQueueing systems. Some important random processes. Elementary queueing theory. Birth-death queueing systems in equilibrium. Markovian queues in equilibrium. Intermediate queueing theory. The queue M/G/I. The Queue G/M/m. The method of collective marks. Advanced material. The queue G/G/I. Appendices. Glossary. A queueing theory primer; Bounds, inequalities and approximations. Priority queueing. Computer time-sharing and multiacces systems. Computer-communication networks: analysis and design. Computer-communication networks: measurement, flow control, and ARPANET traps; Glossary. v. 2 . Computer applications - ISBN - 0-471-49111-X. |
Contents
PRELIMINARIES | 1 |
General Results | 2 |
Markov BirthDeath and Poisson Processes | 3 |
Copyright | |
27 other sections not shown
Other editions - View all
Common terms and phrases
arrival occurs arrival rate arriving customer assume average number behavior birth birth-death process busy period calculate Chapman-Kolmogorov equation Chapter coefficients condition consider constant continuous-time Markov chain convolution customers arrive define definition denote density function derivative equilibrium probability ergodic example exponentially distributed expression factor finite flow Fx(x given in Eq gives hippie independent instants integral interarrival interval inversion Laplace transform last equation limit linear Markov chain Markov processes Markovian matrix memoryless method node notation number of arrivals number of customers o(At obtain p₁ parameter permit Poisson arrival Poisson process population probability vector queueing system queueing theory random process random variables random walk reader referred result semi-Markov processes sequence server service facility shown in Figure solution solve stages state-transition-rate diagram stochastic processes theorem transition probabilities waiting X₁ z-transform zero