Properties of Recurrent Equations for the Full-Availability Group with BPP Traffic

Abstract

The paper proposes a formal derivation of recurrent equations describing the occupancy distribution in the full-availability group with multirate Binomial-Poisson-Pascal (BPP) traffic. The paper presents an effective algorithm for determining the occupancy distribution on the basis of derived recurrent equations and for the determination of the blocking probability as well as the loss probability of calls of particular classes of traffic offered to the system. A proof of the convergence of the iterative process of estimating the average number of busy traffic sources of particular classes is also given in the paper