Overflow traffic from the viewpoint of renewal theory

In this paper some known formulae concerning overflow traffic have been derived in a simpler way than is generally done in literature, i.e. by using simple results obtained from elementary renewal theory.
After the model has been introduced, the distribution of intervals between overflows is calculated by means of a recurrence relation. A generalization of Erlang's formula for the call congestion follows almost immediately. The last section the special case of Poisson input is discussed.