Introduction to queueing theory
The book is not intended to be characterized as either 'theoretical' or 'applied'. The emphasis of the book is on understanding the interplay of mathematical and heuristic reasoning that underlies queueing theory and its applications, with the following two objectives: 1) To give the student sufficient understanding of the theory so that he will be able to apply it in the practice of operations research, and 2) To give the student the background required to read the literature and embark on research.
34 pages matching finite in this book
Results 1-3 of 34
What people are saying - Write a review
We haven't found any reviews in the usual places.
Scope and Nature of Queueing Theory
Multidimensional BirthandDeath Queueing Models
Imbedded Markov Chain Queueing Models
3 other sections not shown
arbitrary customer arrival epoch arriving customer arriving customer's distribution assumed Bernoulli trials birth-and-death process blocked customers busy period calculate carried load Chapter conditional probability consider customers arrive customers waiting customers who find defined derivation distribution function distribution Pj Erlang loss example exponential service exponentially distributed formula geometric distribution given by equation input process interarrival interval of length iteration Laplace-Stieltjes transform M/G/l queue Maclaurin series Markov chain Markov property mathematical mean number mean service mean waiting mutually independent number of customers observer's distribution obtained offered load order of arrival order of service overflow group Pj(t Poisson distribution Poisson input Poisson process primary group probability generating function quasirandom input queue discipline queueing models queueing theory random variable recurrence requests for service result right-hand side servers busy service completion service time distribution solution solve systems with Poisson Takacs test customer trunks values waiting customers waiting for service waiting time distribution