Trunk group dimensioning for overflow traffic has not been solved yet. Several approaches have been developed, based on the peakness factor. Nevertheless, a more rigorous approach due to LeGall, based on the congestion function, takes into account all the statistical information about the nature of this kind of traffic and thus leads to more accurate resutls.
The present paper presents a new calculation for this function, using nolinear dynamics methodology, which eliminates all its problems -numerical instabilities, interative calculation- and provides a simple expression that allows fast dimensioning of hhuge networks. As a corollary of this results, an upper bound of the well known Erlang-B formula is obtained so as several uses of the congestion formula for the dimensioning of trunk groups with overflow traffic offered.
© 2001-2024 Fundación Dialnet · Todos los derechos reservados