Trunking Problem

The infinite system L₁, L₂, …, L_r, … of parallel channels is receiving traffic by a Poisson input. Each call enters at L₁, proceeding, if L₁ was occupied, along the line of channels until it arrives at an unoccupied channel. Palm has solved the case of identical exponential channels. In what follows we shall consider identical channels with an arbitrary service-time distribution.