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
