Traffic equations

From Wikipedia, the free encyclopedia
Jump to: navigation, search

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

Jackson network[edit]

In a Jackson network, the mean arrival rate at each node i in the network is given by the sum of external and internal arrivals. If external arrivals have rate and the routing matrix[clarification needed] is P, the traffic equations are,[2] (for i = 1, 2, ..., m)

This can be written in matrix form as

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

Gordon–Newell network[edit]

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


  1. ^ a b Mitrani, I. (1997). "Queueing networks". Probabilistic Modelling. p. 122. doi:10.1017/CBO9781139173087.005. ISBN 9781139173087. 
  2. ^ Harrison, Peter G.; Patel, Naresh M. (1992). Performance Modelling of Communication Networks and Computer Architectures. Addison-Wesley. ISBN 0-201-54419-9. [page needed]