Skip to content
Lizely

Queueing Theory Calculator

Calculate steady-state M/M/1 utilization, queue length, system population, waiting time, and total time with assumptions shown beside the result.

Privacy: your files never leave your device. All processing happens locally in your browser.

How to use

  1. 1.Enter a positive arrival rate λ and service rate μ using the same time unit.
  2. 2.Confirm that μ is greater than λ and that Poisson arrivals, exponential service, one FIFO server, and steady state are reasonable assumptions.
  3. 3.Calculate and inspect utilization, Lq, L, Wq, and W, then copy the metrics with their unit interpretation.

About Queueing Theory Calculator

Queueing Theory Calculator evaluates the standard steady-state M/M/1 model from an arrival rate λ and service rate μ. Enter both rates in the same time unit. The page reports utilization, average number waiting, average number in the whole system, average queue wait, and average total time. Results stay in the browser and can be copied for a worksheet or capacity discussion.

M/M/1 is Kendall notation for a specific queue. The first M means Markovian arrivals, commonly modeled as a Poisson process with independent exponential interarrival times. The second M means independent exponential service times. The 1 means there is one server. This page also assumes first-in-first-out service, an unlimited calling population, infinite waiting capacity, and a stationary long-run regime. Those assumptions are essential, not decorative labels.

A steady state exists only when the service rate is greater than the arrival rate. Utilization is ρ = λ/μ, and the idle probability is 1−ρ. The average number in the system is L = λ/(μ−λ); the average number waiting is Lq = λ²/[μ(μ−λ)]. Average total time is W = 1/(μ−λ), while average queue wait is Wq = λ/[μ(μ−λ)]. The implementation also verifies Little’s law numerically: L = λW and Lq = λWq.

Time units follow the rates. If λ and μ are per hour, W and Wq are hours. If both are per minute, the times are minutes. Mixing arrivals per hour with services per minute produces a meaningless result even though both inputs are valid numbers. Convert both rates to one basis before calculating, and keep enough precision to represent the real operating estimate rather than a rounded target.

The dramatic growth near capacity is a feature of the model. At λ=9 and μ=10, utilization is 90%, yet the average system population is 9 and average total time is one full rate-time unit. As λ approaches μ from below, the denominators shrink and expected waits grow without bound. The page rejects λ greater than or equal to μ instead of printing a finite-looking answer for an unstable queue.

Real systems often violate M/M/1 assumptions. Arrivals can be scheduled or bursty; service times may be nearly constant, heavy-tailed, or dependent on request type; there may be several servers, finite capacity, priority classes, abandonment, vacations, batching, or changing rates by hour. In those cases M/D/1, M/G/1, M/M/c, finite-capacity models, simulation, or observed percentile analysis may be more appropriate. Mean values also do not describe tail latency or service-level risk.

Eight independently derived rational cases cover utilization from 25% through 90%, fractional rates, and the approach to saturation. Tests cross-check all five displayed metrics and both Little’s-law identities, while boundary tests reject zero and unstable rates. Inputs are bounded away from numerical underflow and capped to keep floating-point results finite and understandable.

Use this calculator as an educational reference, a rough single-server capacity baseline, or a check against a textbook exercise. Do not use it alone to make safety, staffing, medical triage, customer-service, or infrastructure commitments. First validate the arrival and service distributions with observed data, choose the appropriate queue model, examine variability and percentiles, and review consequences of error.

Methodology & sources

Validate same-unit rates from 1e-12 through 1e12 with 0 < lambda < mu, then evaluate the steady-state M/M/1 equations rho=lambda/mu, L=lambda/(mu-lambda), Lq=lambda^2/[mu(mu-lambda)], W=1/(mu-lambda), and Wq=lambda/[mu(mu-lambda)]. Reject unstable or non-finite results and cross-check Little's law.

Frequently asked questions

Why must service rate be greater than arrival rate?
Without μ greater than λ, the infinite-capacity M/M/1 model has no finite steady-state queue; expected congestion grows without bound.
What unit are W and Wq in?
They use the inverse of the common rate unit: per-hour rates produce hours, and per-minute rates produce minutes.
Does 80% utilization mean an 80% wait?
No. Utilization is the server’s busy fraction; waiting time grows nonlinearly as λ approaches μ.
Can this model several servers?
No. M/M/1 has exactly one server; multi-server systems require M/M/c or another appropriate model.

Related tools

Calculators guides

View all