Queueing Systems credit:

4 Hours

An introduction to queueing systems and their applications in engineering. Topics include both classical single-stage models and queueing networks. Students will learn how to apply key ideas and methods of queueing theory, such as: Markov processes, embedded Markov chains, PASTA property, reversibility, productform stationary distributions, stochastic stability, asymptotic analysis. Prerequisite: IE 410 or an equivalent graduate stochastic processes course.