Queues are a ubiquitous part of everyday life; common examples are supermarket checkout stations, help desk call centers, manufacturing assembly lines, wireless communication networks, and multi-tasking 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 Prerequisite(s)
Multivariate calculus and a graduate course in probability and statistics such as EN.625.603 Statistical Methods and Data Analysis.
Course Offerings
|
Waitlist Only
Queuing Theory with Applications to Computer Science
01/21/2025 - 04/29/2025
Tues 7:20 p.m. - 10:00 p.m. |