Ma · Mathematics

How to Calculate Arrival and Service Rates

Published By the 9to5Science editorial team

At a glance

  1. 1. Count arrivals

    Divide the number of arrivals by the length of the observation period.

  2. 2. Find service time

    Measure the time spent serving each job, excluding time waiting in the queue.

  3. 3. Convert to a rate

    Use the reciprocal of the mean service time, and express both rates in matching time units.

  4. 4. Check capacity

    For multiple identical servers, compare the arrival rate with the combined service capacity.

In queueing theory, the arrival rate describes how quickly customers, jobs, or items enter a system. The service rate describes how quickly a server can process them. Both are rates, so their units might be customers per minute, jobs per hour, or requests per second.

The basic calculations are straightforward: count arrivals over a time interval, and take the reciprocal of the average time needed to serve one item. The main source of confusion is mixing time units or treating observed throughput as the same thing as a server’s maximum service capacity.

Calculate the arrival rate

If NN arrivals occur during an observation period of length TT, the average arrival rate is

λ=NT.\lambda = \frac{N}{T}.

For example, if 48 customers arrive in 4 hours, then

λ=48 customers4 hours=12 customers per hour.\lambda = \frac{48\text{ customers}}{4\text{ hours}} = 12\text{ customers per hour}.

This is an average over the chosen period. It does not mean that exactly 12 customers arrive in every hour. Arrivals may be uneven: some hours can be busier than others. If demand varies substantially by time of day, calculate separate rates for relevant periods rather than combining them into one average.

You can also estimate the rate from the times customers arrive. Let XiX_i be the time between arrival i−1i-1 and arrival ii. The estimated mean interarrival time is the average of the observed gaps, and the estimated arrival rate is its reciprocal:

λ^=1X‾.\widehat{\lambda} = \frac{1}{\overline{X}}.

For instance, a mean gap of 5 minutes corresponds to 1/51/5 customer per minute, or 12 customers per hour. Do not confuse an average gap with the average number of arrivals in a particular short interval.

Calculate the service rate

Measure service time: how long a server actively takes to complete one customer’s job. This does not include time the customer spends waiting in line. If the mean service time is S‾\overline{S}, the service rate for one server is

μ=1S‾.\mu = \frac{1}{\overline{S}}.

If a cashier takes an average of 4 minutes to serve one customer, then

μ=14 minutes per customer=0.25 customers per minute=15 customers per hour.\mu = \frac{1}{4\text{ minutes per customer}} = 0.25\text{ customers per minute} = 15\text{ customers per hour}.

The reciprocal changes the units: minutes per customer become customers per minute. Convert to the time unit you need after taking the reciprocal.

When service times are recorded individually, first find their arithmetic mean, then take its reciprocal. In general, the reciprocal of the mean service time is not the same as the mean of the reciprocals of individual service times. The standard queueing-model service rate is 1/S‾1/\overline{S}.

Worked example: a two-server system

Suppose a help desk receives 48 requests in 4 hours, and the average time to handle one request is 4 minutes. There are two identical agents, and each can work on one request at a time.

  1. Arrival rate: 48/4=1248/4 = 12 requests per hour.
  2. Per-agent service rate: 60/4=1560/4 = 15 requests per hour.
  3. Combined nominal capacity: 2(15)=302(15) = 30 requests per hour, if both agents are available to serve.
  4. Utilization estimate:
ρ=λcμ=122(15)=0.40.\rho = \frac{\lambda}{c\mu} = \frac{12}{2(15)} = 0.40.

Here, c=2c=2 is the number of agents. The calculation gives a utilization of 40% under the simple assumption that demand and service capacity are represented by steady average rates. With one agent, the corresponding utilization would be 12/15=0.8012/15=0.80, or 80%.

For a stable queue with cc identical servers, the average arrival rate must be below their combined service capacity, λ<cμ\lambda < c\mu. For one server, this condition is λ<μ\lambda < \mu. These conditions indicate whether the system can keep up in the long run under the model; they do not by themselves determine the typical waiting time.

Be clear about what you observed

An arrival rate is usually estimated from arrivals during the observation period. A service rate is usually estimated from service times measured while a server is actually working. If you instead divide the number of completed jobs by the full observation time, including periods when the server was idle, you get an observed throughput. That can be lower than the server’s service capacity because the server had no work to do.

For multiple servers, cμc\mu is the combined capacity only when the servers have the same service rate and can all serve in parallel. If their rates differ, add their individual rates to get nominal combined capacity. Real systems can also have breaks, setup time, blocked work, or shared equipment that reduces effective capacity.

Common mistakes

  • Mixing units: Compare rates in the same units. Convert 12 customers per hour to 0.2 per minute before comparing it with a per-minute rate.
  • Including waiting in service time: Waiting in line affects total time in the system, but it is not part of the time a server spends serving a job.
  • Calling throughput service capacity: Completions per hour during a period with idle time do not necessarily measure how fast the server works when busy.
  • Assuming rates describe all variation: Two systems can have the same average arrival and service rates but different waiting times if arrivals or service durations vary differently. Rates alone do not specify a complete queueing model.
  • Treating the reciprocal as an exact schedule: A service rate of 15 per hour means an average capacity of 15 per hour, not that one customer is completed precisely every four minutes.

Arrival and service rates are the basic inputs to queueing models. If you use them to predict waiting times, also check the model’s assumptions—for example, whether arrivals are treated as random and whether service times follow a specified distribution.

References

  1. Fundamentals of Queueing Theory, Donald Gross, John F. Shortle, James M. Thompson, and Carl M. Harris

Spotted an error? Send a correction. Read how we write and check articles in our editorial policy.