In queueing theory, a discipline within the mathematical theory of probability, traffic equations are equations that describe the mean arrival rate of traffic, allowing the arrival rates at individual nodes to be determined. Mitrani notes "if the network is stable, the traffic equations are valid and can be solved."^[1]: 125

In a Jackson network, the mean arrival rate ${\displaystyle \lambda _{i}}$ at each node i in the network is given by the sum of external arrivals (that is, arrivals from outside the network directly placed onto node i, if any), and internal arrivals from each of the other nodes on the network. If external arrivals at node i have rate ${\displaystyle \gamma _{i}}$, and the routing matrix^[2] is P, the traffic equations are,^[3] (for i = 1, 2, ..., m)

${\displaystyle \lambda _{i}=\gamma _{i}+\sum _{j=1}^{m}p_{ji}\lambda _{j}.}$

This can be written in matrix form as

${\displaystyle \lambda (I-P)=\gamma \,,}$

and there is a unique solution of unknowns ${\displaystyle \lambda _{i}}$ to this equation, so the mean arrival rates at each of the nodes can be determined given knowledge of the external arrival rates ${\displaystyle \gamma _{i}}$ and the matrix P. The matrix I − P is surely non-singular as otherwise in the long run the network would become empty.^[1]

In a Gordon–Newell network there are no external arrivals, so the traffic equations take the form (for i = 1, 2, ..., m)

${\displaystyle \lambda _{i}=\sum _{j=1}^{m}p_{ji}\lambda _{j}.}$