The Foundation of Queueing Theory
2
Networking and Services
Advanced studies
1st meeting: Preliminaries on the Poisson process, the exponential distribution and renewal theory. Little"s rule. The M/M/1 and the M/G/1 queueing models. Khintchine-Polazceck formula via mean value analysis 2nd meeting: Priority queues. Stand-by customers and externalities. Service length based priority queues. 3rd meeting: Preliminaries on discrete and continuous Markov chains. Limit probabilities and waiting times in the M/M/1, G/M/1 and M/G/1 models. 4th meeting: Closed and open networks of exponential queues. Limit probabilities and the arrival theorem. Mean value analysis and algorithms for deriving performance measures. 5th meeting: Symmetric and product form queues. Examples: processor sharing, loss systems and last-come first-served queues.
Lectures
Time | Room | Lecturer | Date |
---|---|---|---|
Thu 14-17 | C220 | Moshe Haviv | 06.10.2016-06.10.2016 |
Fri 14-17 | C220 | Moshe Haviv | 07.10.2016-07.10.2016 |
Mon 14-17 | B119 | Moshe Haviv | 10.10.2016-10.10.2016 |
Thu 14-17 | C220 | Moshe Haviv | 13.10.2016-13.10.2016 |
Fri 14-17 | C220 | Moshe Haviv | 14.10.2016-14.10.2016 |