 |
|
What people are saying - Write a reviewReview: Queueing Systems, Volume 1: TheoryUser Review - Dan - GoodreadsI can't say I read the whole thing. The parts that I did read had great mathematical beauty. A good writer, and a deep mathematician. Read full review Review: Queueing Systems, Volume 1: TheoryUser Review - Bob - GoodreadsUsed as a textbook by Prof. J. Laurie Snell, Mathematics Department, Dartmouth College for an elective topics course in Operations Research, Fall 1979. Read full review Related books
Contents
46 other sections not shown Other editions - View all
Common terms and phrasesarriving customer assume average number behavior birth-death process busy period calculate Chapman-Kolmogorov equation Chapter Cn+1 coefficients condition consider constant convolution customers arrive define definition denote density function departure derivative discrete-time equal equilibrium probability ergodic Erlangian evaluate example exponentially distributed expression factor finite flow geometric distribution given in Eq gives hippie imbedded Markov chain independent instants integral interarrival interval invert Laplace transform last equation limit linear M/M/l queue M/M/l system Markov process matrix memoryless method node notation number of arrivals number of customers obtain parameter permit Pk(t Poisson arrival Poisson process probability vector queueing system queueing theory random variables random walk reader referred renewal theory result semi-Markov processes sequence server service facility service-time shown in Figure solution solve state-transition-rate diagram stochastic processes theorem transition probabilities vector waiting z-transform zero Bibliographic information
|
