Skip to Calculator

Erlang Calculator

Calculate trunk lines and agent staffing using Erlang B and Erlang C traffic engineering formulas.

Updated

Erlang Calculator

Calculate trunk lines and agent staffing using Erlang B and Erlang C traffic engineering formulas.

1 – 100,000
1 – 7,200 seconds

Enter your call volume and duration above, then click Calculate to size your trunks or agents.

Based on ITU-T Recommendation E.501 —·Updated Mar 2026·Free, no signup

How to Use This Calculator

Select Calculation Mode

Choose Erlang B for trunk line dimensioning (blocking model) or Erlang C for call center agent staffing (queuing model).

Enter Traffic Parameters

Input the number of calls per hour and average call duration in seconds. These determine your traffic intensity in Erlangs.

Set Service Targets

Define your target grade of service (blocking percentage for Erlang B, or wait probability for Erlang C) and target answer time for Erlang C calculations.

Review Results

View required trunk lines or agents, blocking/wait probability, average wait time, service level percentage, and agent occupancy rate.

How We Calculate

This calculator implements the classical Erlang B and Erlang C traffic engineering formulas developed by Danish mathematician Agner Krarup Erlang in 1917. The Erlang B formula models a loss system where blocked calls are cleared — it calculates the probability that all trunk lines are busy when a new call arrives. The iterative form B(N,A) = (A·B(N-1,A))/(N + A·B(N-1,A)) is used for numerical stability, avoiding factorial overflow that plagues the direct formula.

The Erlang C formula extends this to queuing systems where callers wait rather than being lost. It calculates the probability that an arriving call must wait for an available agent. Service level is computed as SL = 1 - C(N,A)·e^(-(N-A)(t/Ts)), where t is the target answer time and Ts is the average service time. This is the standard model used by workforce management platforms worldwide, as documented in the ITU-T E.500 series recommendations.

Traffic intensity (in Erlangs) is calculated as A = (calls per hour × average call duration in seconds) / 3600. One Erlang represents one circuit occupied continuously for one hour. The calculator iteratively finds the minimum number of trunks or agents needed to meet the specified grade of service target, starting from the theoretical minimum of ⌈A⌉ and incrementing until the target is achieved.

Sources & References

  • ITU-T Recommendation E.501 — Estimation of Traffic Offered in the Network (itu.int)
  • Iversen, V.B. — Teletraffic Engineering and Network Planning, Technical University of Denmark (2015)
  • COPC Inc. — Contact Center Operations Management Standard (copc.com)

Data last verified:

Frequently Asked Questions

Erlang B models a loss system where blocked calls are simply rejected or cleared — this is used for dimensioning trunk lines in telephone networks. Erlang C models a queuing system where callers wait in a queue until an agent becomes available — this is the standard model for call center staffing. Choose Erlang B when callers receive a busy signal, and Erlang C when callers are placed on hold.

An Erlang is the unit of telecommunications traffic intensity. One Erlang equals one circuit (or trunk line) occupied continuously for one hour. It is calculated as: Traffic (Erlangs) = (Calls per hour × Average call duration in seconds) / 3600. For example, 600 calls per hour with an average duration of 180 seconds produces 30 Erlangs of traffic.

For trunk line dimensioning with Erlang B, a common target is P.02 (2% blocking probability), meaning only 2% of call attempts are blocked. For call centers using Erlang C, typical targets are 80/20 (80% of calls answered within 20 seconds) or 90/10. The right target depends on your industry, customer expectations, and cost constraints.

If your traffic intensity is 30 Erlangs, you need more than 30 agents because calls arrive randomly — sometimes multiple calls arrive simultaneously. The Erlang formulas account for this statistical variation. Having exactly 30 agents for 30 Erlangs of traffic would result in nearly 100% occupancy and extremely long wait times for callers.

The Erlang C formula assumes calls arrive following a Poisson distribution and call durations follow an exponential distribution. While real-world call patterns may deviate from these assumptions (e.g., daily traffic peaks, non-random arrivals), Erlang C remains the industry standard for initial staffing estimates. Most workforce management platforms use Erlang C as their core engine, supplemented by historical data adjustments.

Agent occupancy is the percentage of time agents spend actively handling calls versus waiting. It is calculated as traffic intensity divided by the number of agents. High occupancy (above 85-90%) leads to agent burnout and degraded service levels. Conversely, very low occupancy means overstaffing. Optimal occupancy typically ranges from 70-85% depending on the service level target.

Yes, Erlang B is widely used for SIP trunk planning. While SIP trunks are virtual rather than physical circuits, the mathematical model still applies. Input your expected concurrent call volume and the calculator determines how many SIP channels you need to maintain your target grade of service. Many VoIP providers use Erlang B calculations for capacity planning.

Erlang C calculates the number of agents needed on the phones. In practice, you must add shrinkage — the percentage of scheduled time agents are unavailable (breaks, training, meetings, absenteeism). Typical shrinkage is 25-35%. If Erlang C recommends 40 agents, with 30% shrinkage you need to schedule approximately 57 agents (40 / 0.70) to ensure 40 are available.

In an Erlang B system, calls that arrive when all trunks are busy receive a busy signal and are lost — the caller must retry. This is called blocking. In an Erlang C system, excess calls are queued and callers wait. If the queue grows unchecked, average wait times increase exponentially. Monitoring real-time traffic against your Erlang calculations helps prevent service degradation during peak periods.

Agner Krarup Erlang (1878-1929) was a Danish mathematician and engineer who pioneered the field of traffic engineering and queuing theory while working at the Copenhagen Telephone Exchange. He published his foundational paper on blocking probabilities in 1917. The unit of telecommunications traffic (the Erlang) and the Erlang programming language are both named in his honor.

ToolSite Team

We build free, accurate calculators.