Solving the steady-state number of customers in a queue

To get started, select one of these examples, then press the "Submit" button:

1) Type in the parameters of the queue
	N	Maximum number in system (buffer + server)

2) Select the inter-arrival time
	t_a	Mean time between two arrivals

3) Select the service time
by: its mean and coefficient of variation or a specific Coxian distribution
	k t_s	Mean service time Number of phases (max=10)
	cv_s	Coefficient of variation

Cox2 distribution

Arrivals follow a Coxian distribution with 2 stages with μ₁ = , μ₂ = and q_b1 = .

change

Services follow a simple Exponential distribution with rate μ₁ =

Erlang distribution queue

Services follow an Erlang or hypoexponential distribution with n = stages at rate μ₁ = and μ₂ = .

Coxian distribution

Services follow a generalized Coxian distribution

σ_i

μ_i

q_bi

Phase 1:

Phase 2:

Phase 3:

Phase 4:

Phase 5:

Phase 6:

Phase 7:

Phase 8:

Phase 9:

Phase 10:

1) Type in the parameters of the queue