Contribution to studies of overflow traffic

Presents a mathematical treatment of the problem of overflow traffic and of the probability of finding 0, 1, 2,.., n paths busy. This is done for a limited number of overflow trunks, instead of on unlimited group as done by Riordan. The second part of the article deals with overflow from two, instead of one, primary groups, again deriving the moments of the unlimited overflow distribution. The results are discussed and compared with those of other publications.