Abstract
Traffic overflowing a first-choice trunk group can be approximated accurately by a simple renewal process called an interrupted Poisson processa Poisson process which is alternately turned on for an exponentially distributed time and then tur...