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

Mariusz GÅ‚Ä…bowski, Maciej Stasiak and Joanna Weissenberg

Mathematical Problems in Engineering, 2012, vol. 2012, 1-17

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.

Date: 2012
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2012/547909.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2012/547909.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:547909

DOI: 10.1155/2012/547909

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().