Properties of recurrent equations for the full-availability group with BPP traffic (Q1954907): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1155/2012/547909 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2008505067 / rank | |||
Normal rank |
Revision as of 02:14, 20 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
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