The Calculation of the Loss Probability in Schemes Constructed from Complete Access Groups

We consider symmetric schemes with losses constructed from complete access groups, in the case of the arrival of a simple stream and of an Engset stream with an exponential serving law. We apply to the expressions for the loss probability some combinatorial relations which considerably simplify their form, permitting them to be computed on a digital computer. Numerical examples are given.