The goal of the course is to provide a good mathematical understanding
of queues. Queues arise in situations where demand exceeds
supply. This theory helps derive several performance measures of a
queue such as waiting time in queues, how customers accumulate in
queues, probability of encountering an idle server etc. The theory has
wide applicability in job scheduling (computer science), networks and
operation research (assembly lines, facility design etc).
A prerequisite for the course is a good understanding of
probability.
Topics covered in this course will include: Brief background on Random
processes, Markov Chains, Birth-Death processes, Little's theorem,
M/M/* Queues, M/G/1 Queues, Queueing Networks, Advanced Markovian
Queueing Models, Some case studies employing queueing theory in
evaluating networks
Text Books:
There is no one source of material for this course. The material will
be drawn from the following textbooks and web. I will post the links
to the web material used as and when needed. If you take proper notes,
you can manage the course comfortably.
Fundamentals of Queueing Theory, Gross and Harris, 3rd Edition
An Introduction to Queueing Systems, S. K. Bose
Course Evaluation:
Open Ended Quizzes(3 * 5%)
15%
Mid-semester exams (2* 20%
40%
End-semester exam
45%
I will periodically give some home-works for you to solve. The
solutions will be put up after a few days. The purpose of this
exercise is to give you some practise on solving problems. These will
not be graded though. So, it is in your best interest if you try
solving these problems on your own or through discussion with your
friends, before you look at the solutions.
Last modified: Thu Dec 28 19:01:27 IST 2006