Properties of recurrent equations for the full-availability group with BPP traffic (Q1954907): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 05:21, 5 March 2024

scientific article
Language Label Description Also known as
English
Properties of recurrent equations for the full-availability group with BPP traffic
scientific article

    Statements

    Properties of recurrent equations for the full-availability group with BPP traffic (English)
    0 references
    0 references
    0 references
    0 references
    11 June 2013
    0 references
    Summary: 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.
    0 references

    Identifiers