Queuing Theory: from Markov Chains to Multi-Server Systems (edX)

Start Date
No sessions available
Queuing Theory: from Markov Chains to Multi-Server Systems (edX)
Course Auditing
Categories
Effort
Certification
Languages
Some knowledge of basic statistical theory and probability will be required for the course. Lab work will require some familiarity with Python 3.
Misc

MOOC List is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

Queuing Theory: from Markov Chains to Multi-Server Systems (edX)
Learn key mathematical tools necessary to anticipate the performance levels of queueing systems and understand the behavior of other systems that evolve randomly over time. Situations where resources are shared among users appear in a wide variety of domains, from lines at stores and toll booths to queues in telecommunication networks. The management of these shared resourcescan have direct consequences on users,whether it be waiting times or blocking probabilities.

MOOC List is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

In this course, you'll learn how to describe a queuing system statistically, how to model the random evolution of queue lengths over time and calculate key performance indicators, such as an average delay or a loss probability.




This course is aimed at engineers, students and teachers interested in network planning.

Practical coursework will be carried out using ipython notebooks on a Jupyterhub server which you will be given access to.
What you'll learn

- Characterize a queue, based on probabilistic assumptions about arrivals and service times, number of servers, buffer size and service discipline

- Describe the basics of discrete time and continuous time Markov chains

- Model simple queuing systems, e.g. M/M/1 or M/M/C/C queues, as continuous time Markov chains

- Compute key performance indicators, such as an average delay, a resource utilization rate, or a loss probability, in simple single-server or multi-server system

- Design queuing simulations with the Python language to analyze how systems with limited resources distribute them between customers


Syllabus


This is a five week course :

- Week 1 is an introduction to queuing theory. We will introduce basic notions such as arrivals and departures. Particular attention will be paid to the Poisson process and to exponential distribution, two important particular cases of arrivals and service times.

- During week 2 we will analyze a first simple example of a no-loss queue , the so called M/M/1 queue, and we will compute its average performance metrics.

- Week 3 will be dedicated to a basic course in discrete time Markov chains. We will learn how they are characterized and how to compute their steady-state distribution.

- Then in week 4 we will move on to continuous time Markov chains. Again we will learn how to characterize them and how to analyze their steady-state distribution. Equipped with these tools we will then analyze the M/M/1 queue.

- In week 5 we will study multiserver and finite capacity queues and study how to dimension a loss network.

Each week of the course will include five or six video lectures, a quiz to test your understanding of the main concepts introduced during that week and a lab using python.



MOOC List is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

Course Auditing
44.00 EUR
Some knowledge of basic statistical theory and probability will be required for the course. Lab work will require some familiarity with Python 3.

MOOC List is learner-supported. When you buy through links on our site, we may earn an affiliate commission.