Poisson Limit Theorem for Message Switching Networks with Low Transit Traffics

A sequence of communication networks with increasing branching and low traffic intensities on the transit routes is considered. The limiting message throughput delay distribution is shown to be the same that for the series of stochastically independent queues. This is an example of the so-called Poisson conjecture being valid for a sufficiently complex queueing network.