> For the complete documentation index, see [llms.txt](https://isubasinghe.gitbook.io/isithas-wiki/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://isubasinghe.gitbook.io/isithas-wiki/math/queueing_theory.md).

# queueing theory

## Basic idea

Queueing theory relates arrival processes, service demand, utilization, throughput, and delay. It supplies operational laws that apply broadly and distribution-specific results for models such as $M/M/1$.

## Key formulas

* Utilization law: $U=XS$, where $X$ is throughput and $S$ is service demand per completion.
* Little's law: $N=X R$ for average population $N$, throughput $X$, and residence time $R$ under stability assumptions.
* A single server approaches saturation as $U\to1$, causing queueing delay to grow sharply.
