Part of the Technology & IT suite · 45 calculators

Erlang C Calculator

The Erlang C queueing model: for a given arrival rate, service time and number of servers (or agents), the chance a request waits, how long it waits on average, the utilization — and how many servers you need to hit a target.

Requests arriving at random at λ per second, each taking S seconds, present an offered load of A = λS erlangs.

Results update as you type
Results
Probability of waiting
17.6 %
Offered load
Utilization
Average wait (all arrivals / those who wait)
Share served within the target time
Servers needed to meet the target
Reviewed September 2026. Computing arithmetic: bytes, bits, seconds and probabilities do not change by country. US broadband is advertized in megabits per second (Mbps).
No account required · Google Analytics off unless allowedCalculator arithmetic runs in your browserResults update as you type
All calculations run 100% in your browser. The calculator code does not submit your figures to GlobalCalc to obtain a result.
About erlang c

How the erlang c calculator works

Requests arriving at random at λ per second, each taking S seconds, present an offered load of A = λS erlangs. With c servers and A < c the queue is stable; Erlang C gives the probability that an arrival finds every server busy and must wait, and the average wait follows as that probability × S ÷ (c − A). It is the model behind call-center staffing and server-pool sizing, and it shows why running at 95% utilization means long queues.

Formula: A = λ S; P_wait = (Aᶜ ÷ c!) ÷ ((Aᶜ ÷ c!) + (1 − A/c) Σₖ₌₀ᶜ⁻¹ Aᵏ ÷ k!); W = P_wait × S ÷ (c − A)

Worked examples

InputsProbability of waitingNote
100 calls/min, 180 s handling, 320 agents17.6 %300 erlangs; 24% wait
Same load with 310 agents45.6 %over half wait
A small helpdesk: 10/hour, 15 min, 4 staff32 %2.5 erlangs; 20% wait

Frequently asked questions

What is an erlang?

One erlang is one server continuously busy: the offered load is the average number of servers that would be occupied if none had to wait. 300 erlangs of calls need more than 300 agents — how many more depends on the wait you will accept.

Why does utilization above 85% hurt so much?

Because the wait grows as 1 ÷ (c − A): the gap between servers and load is what absorbs randomness. Going from 85% to 95% utilization roughly triples the average wait; the last few percent of efficiency cost most of the service level.

What are the model’s assumptions?

Random (Poisson) arrivals, exponential service times, a single queue served in order, infinite patience and no abandonment. Real callers hang up, which makes Erlang C pessimistic; Erlang A adds abandonment.

How do I use it for web servers?

Requests per second as λ, mean response time as S, worker threads or instances as c. A target such as "95% served within 500 ms" translates directly to the target fields.

Where these figures come from

Last checked: September 2026. Units follow the SI decimal convention (IEC 80000-13 defines the binary alternatives); network and security figures cite the defining standard.