Erlang C Calculator (M/M/c Queue)

Erlang C Calculator (M/M/c Queue)

Growing AI Skill PRO

Enter Calculation

Leave the number of servers blank to see the results at the smallest number that meets your target. The 80% in 20 seconds target is only an example: enter your own.

Formula

B0=1,Bk=ABk−1k+ABk−1C(c,A)=cBcc−A(1−Bc),A<c\begin{aligned}&B_0=1,\quad B_k=\dfrac{A\,B_{k-1}}{k+A\,B_{k-1}}\\&C(c,A)=\dfrac{c\,B_c}{c-A\,(1-B_c)},\quad A<c\end{aligned}
Show calculation steps (2)
  1. Waiting time, time in system and queue length

    Wq=C(c,A)cμ−λ,W=Wq+1μLq=λWq,L=λW\begin{aligned}&W_q=\dfrac{C(c,A)}{c\mu-\lambda},\quad W=W_q+\dfrac{1}{\mu}\\&L_q=\lambda W_q,\quad L=\lambda W\end{aligned}

    Mean wait in queue, mean time in system, and Little's law for the queue and the system.

  2. Service level

    SL=P(Wq≤T)=1−C(c,A)e−(cμ−λ)T\begin{aligned}&\text{SL}=P(W_q\le T)\\&\quad=1-C(c,A)\,e^{-(c\mu-\lambda)T}\end{aligned}

    Share of arrivals that wait no longer than T (first come, first served).

Usage stats

Advertisement

Results

Servers needed to meet your target
11
Target: P(Wq ≤ 20 s) ≥ 80%
Service level at that staffing: 80.92%
Your staffing misses the target. Add servers until you reach the number above.
Results with c = 10
Traffic intensity (A = λ/μ)
8 Erl
Utilization (ρ = A/c)
80%
Stable queue (ρ < 1)
Yes
Probability of waiting (Erlang C)
40.92%
Service level
65.36%
P(Wq ≤ 20 s)
Wait longer than T
34.64%
Average wait in queue (Wq)
49.1 s
Average time in system (W)
4.82 min
Average queue length (Lq)
1.637
Average number in system (L)
9.637
Average wait of those who wait
2 min
Average service time
4 min
Servers vs. service level
Servers (c) Utilization P(wait) Avg wait Service level
10 yours 80% 40.9% 49.1 s 65.4%
11 72.7% 24.5% 19.6 s 80.9% meets
12 66.7% 14% 8.39 s 90% meets
13 61.5% 7.6% 3.65 s 95% meets
14 57.1% 3.9% 1.57 s 97.6% meets
Little's law check: λ × W = L 0.033333/s × 289.1016 s = 9.637
Model: M/M/c (Erlang C): Poisson arrivals, exponential service times, first come first served, unlimited queue, nobody hangs up. If callers abandon, Erlang A fits better.

Report an error on this page

What this Erlang C calculator answers

"How many agents do we need on the phones?" and "how many servers do we need at launch?" are the same question. Requests arrive at random, each one occupies a server for a while, and anyone who finds every server busy waits in line. This calculator models that as an M/M/c queue and uses Erlang's C formula, first published by the Danish engineer A. K. Erlang in 1917, to give you the probability of waiting, the average wait, the queue length and the share of arrivals answered within a target time.

It then works backwards: it finds the smallest number of servers that meets your service-level target (and, if you set one, a maximum average wait) and shows a short table around that number so you can see what one server more or less changes.

Diagram of an M/M/c queue: customers arrive at rate λ, wait in one shared line, and are served by c parallel servers.
An M/M/c queue: random arrivals at rate λ form one shared line that is served by c identical servers, each taking an average service time s.

How to use it

  • Arrival rate λ: calls, chats, tickets or requests per second, minute or hour. Use the rate for your busiest interval, not a daily average.
  • Average service time: average handle time per arrival (talk plus after-call work in a contact centre, or request processing time for a server). You can also enter the service rate μ per server instead.
  • Servers c: agents, workers, threads or machines that serve in parallel. Leave it blank to see the results at the recommended number.
  • Service-level target: the share of arrivals that should wait no longer than T. The default of 80% within 20 seconds is a widely used example, not a law or a standard. Use your own target.

The same tool covers IT capacity: enter requests per second and a service time in milliseconds, and read "servers" as concurrent workers.

The formulas

With arrival rate λ and mean service time s (service rate μ = 1/s), the offered traffic is A = λ/μ erlangs and the utilization is ρ = A/c. The queue is only stable when A < c. If it is not, the queue grows without limit and the calculator tells you so instead of printing a number.

The probability that an arrival has to wait is Erlang C, C(c, A). The calculator gets it from the Erlang B recursion Bk = A·Bk−1 / (k + A·Bk−1) and C = c·B / (c − A(1 − B)). That route uses no factorials, so it stays accurate for thousands of servers. From C:

  • average wait in queue Wq = C / (cμ − λ), and average time in system W = Wq + 1/μ;
  • average queue length Lq = λWq, and average number in system L = Lq + A;
  • service level P(Wq ≤ T) = 1 − C·e−(cμ−λ)T (first come, first served).

The numbers obey Little's law, L = λW, which the result shows as a check. You can cross-check it with the throughput calculator (Little's law).

Advertisement
Chart of the Erlang C waiting probability falling as servers are added, with the first server count below a target highlighted.
The probability of waiting, C(c, A), falls sharply as servers are added; the first c that meets your target is the staffing answer.

Worked example

A support desk receives 120 calls per hour (2 per minute) and the average handle time is 4 minutes, so A = 2 × 4 = 8 erlangs. With 10 agents the utilization is 80%, 40.9% of callers wait, the average wait is about 49 seconds and only 65.4% are answered within 20 seconds. With 11 agents the probability of waiting falls to 24.5%, the average wait to 19.6 seconds and the service level rises to 80.9%. So 11 agents meet an 80%-in-20-seconds target. With 12 agents it would be 90.0%.

Textbook check: in Iversen's Teletraffic Engineering and Network Planning (Example 9.3.1), a system with 20 erlangs of traffic, a 100-second mean service time and 32 channels has a mean waiting time of 0.075 s. This calculator gives 0.0747 s.

IT example: 5,000 requests per second at 120 ms each is A = 600 erlangs. For 99% of requests to start within 50 ms, you need 610 concurrent workers. That is 98.4% utilization with an average queueing delay of about 7 ms.

Assumptions and limits

  • Arrivals are random and independent (a Poisson process), and service times are exponentially distributed.
  • Arrivals are served first come, first served by identical servers, and the waiting room is unlimited.
  • Nobody gives up. Real callers do hang up, and then Erlang C overstates waiting and the staff you need. The Erlang A model (M/M/N+M, Garnett, Mandelbaum & Reiman, 2002) adds abandonment.
  • The result is for agents actually available to take calls. Add breaks, training and absence (shrinkage) on top.
  • Bursty traffic, retries and very variable service times usually make queues worse than the model predicts. Treat the answer as a lower bound, then test with real load.

For parallel speed-up limits on a single job, see the Amdahl's law calculator.

Sources & References

Last updated:

Most popular in Math and Statistics

View all Math and Statistics calculators