Fixed routing

Consider a network with J links labelled 1, 2, …, J and that each link j has C_j circuits. Let R be the set of all possible routes in the network (combinations of links a call might use) and each route r, write A_jr for the number of circuits route r uses on link j (A is therefore a J x |R| matrix). Consider the case where all elements of A are either 0 or 1 and for each route r calls requiring use of the route arrive according to a Poisson process of rate v_r. When a call arrives if there is sufficient capacity remaining on all the required links the call is accepted and occupies the network for an exponentially distributed length of time with parameter 1. If there is insufficient capacity on any individual link to accept the call it is rejected (lost) from the network.^[5]

Write n_r(t) for the number of calls on route r in progress at time t, n(t) for the vector (n_r(t) : r in R) and C = (C₁, C₂, ... , C_J). Then the continuous-time Markov process n(t) has unique stationary distribution^[5]

${\displaystyle \pi (n)=G(C)^{-1}\prod _{r\in R}{\frac {v_{r}^{n_{r}}}{n_{r}!}}{\text{ for }}n\in S(C)}$

where

${\displaystyle S(C)=\{n\in \mathbb {Z} _{+}^{R}:An\leq C\}}$

and

${\displaystyle G(C)=\left(\sum _{n\in S(C)}\prod _{r\in R}{\frac {v_{r}^{n_{r}}}{n_{r}!}}\right).}$

From this result loss probabilities for calls arriving on different routes can be calculated by summing over appropriate states.