This contribution deals with a formula for the capacity an ATM multiplexer must at least have to accomodate the loss probability demands of all connections. So it can be used for connection admission control as well as for network resource management purposes. The formula is based on the bufferless fluid flow multiplexer model. It allows for a more exact capacity evaluation than if equivalent bandwidths are used on a per-connection basis. On the other hand, it merely requires a computational effort which is comparable to evaluating the mean of a given distribution. Indeed, the bottleneck is the convolution of probability ensity functions, on which the formula operates. Two steps to reduce the computational effort are proposed: a framework for convolution operations, consisting of pre-computed probability density functions, and a suitable truncation of the state space.

Pappret behandlar snabba beräkningar av kapaciteten i datakom nätverk som behövs för att garantera en önskad kvalitetsnivå. Dessa beräkningar grundas på faltningar av bandbredds statistik. Resursbehov, flödesmodell, kapacitetsberäkningar, faltning