Several types of single-stage queueing systems are analysed.
||time-average number of customers in the systems (waiting and in service)
||time-averag number of customers in queue
||average flow time through the system
||average waiting time
||time-average probability of n customers in the system, P0=P(0)
The Kendall/Lee/Taha-notation is explained here: (a,b,c):(d,e,f)-system