Trunking Problem

Abstract

The infinite system L 1 , L 2 , …, L r , … of parallel channels is receiving traffic by a Poisson input. Each call enters at L 1 , proceeding, if L 1 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.