Find Steady State Parameters


1. Choose the Queueing Model

Models with Markovian arrival & service

(M/M/c):
(∞/∞/FIFO)
Single queue, C servers
(M/M/∞):
(∞/∞/FIFO)
Infinite number of servers
(M/M/c):
(K/∞/FIFO)
Queue can hold maximum K customers at any time (extras will be lost)
(M/M/c):
(N/N/FIFO)
Population that can join queue is limited (N)

Other models

(M/D/1):
(∞/∞/FIFO)
Arrivals are determined by a Poisson process and job service times are fixed (Deterministic)

2. Input Values



Result


Probability that number of customers in system is = 0



Graphs