Studies a model of a network of links with the capacity of aninteger number of bandwidth units that are shared amongst callssubdivided in K classes. A class is typified by the bandwidthrequirement on each link and the average holding time of its calls.Calls arrive according to a Bernoulli-Poisson-Pascal process. The jointPDF of the number of bandwidth units in use, is found using a knownrecursion formula that is amenable to numerically instability. Analgorithm that fixes the instability is proposed. Previous articlesconcentrated on time blocking probabilities. Those discussing callblocking probabilities suggest algorithms that are either approximativeor time consuming. The present paper proposes a new one, that is shownto be superior in terms of accuracy and computation and storage overheadto the best exact algorithm available so far
展开▼
