Queues are a ubiquitous part of everyday life; common examples are supermarket checkout stations, help desks call centers, manufacturing assembly lines, wireless communication networks, and multitasking computers. Queuing theory provides a rich and useful set of mathematical models for the analysis and design of service process for which there is contention for shared resources. This course explores both theory and application of fundamental and advanced models in this field. Fundamental models include single- and multiple-server Markov queues, bulk arrival and bulk service processes, and priority queues. Applications emphasize communication networks and computer operations, but may include examples from transportation, manufacturing, and the service industry. Advanced topics may vary.
Course prerequisites: 
Multivariate calculus and a graduate course in probability and statistics such as 625.403 Statistical Methods and Data Analysis or equivalent.
Course notes: 
This course is the same as 625.734 - Queuing Theory with Applications to Computer Science.
Course instructor: 
Nickel

View Course Homepage(s) for this course.

Course all programs: 
Computer Science
Data Science