| Unit name | Introduction to Queueing Networks |
|---|---|
| Unit code | MATH35800 |
| Credit points | 10 |
| Level of study | H/6 |
| Teaching block(s) |
Teaching Block 1 (weeks 1 - 12) |
| Unit director | Dr. Ayalvadi Ganesh |
| Open unit status | Not open |
| Pre-requisites | |
| Co-requisites |
None |
| School/department | School of Mathematics |
| Faculty | Faculty of Science |
Queues are a fact of life - banks, supermarkets, registration at university - especially in the UK where we wait patiently in line for service! The modelling and evaluation of individual queueing systems (in terms of quantities such as customer arrival patterns, service demands, scheduling priorities for different customer classes, queue size and waiting times) has been a rich source of theory and application in applied probability and operational research. More recently, networks of linked queueing systems have gained wide popularity for modelling and performance-evaluation purposes in telecommunications, computer technology and manufacturing. Much of the success of these queueing models can be attributed to their flexible modelling capabilities and to the simple Jackson product-form expressions that are often available to describe steady-state distributions. The course will introduce relevant concepts in the context of a single server queue and look at simple parallel and tandem systems, before going on to develop models and performance criteria applicable to more general networks.
