Properties of Recurrent Equations for the Full-Availability Group with BPP TrafficReportar como inadecuado

Properties of Recurrent Equations for the Full-Availability Group with BPP Traffic - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Mathematical Problems in EngineeringVolume 2012 2012, Article ID 547909, 17 pages

Research ArticleCommunication and Computer Networks, Faculty of Electronics and Telecommunications, Poznan University of Technology, ul. Polanka 3, 60-965 Poznan, Poland

Received 27 April 2011; Accepted 1 August 2011

Academic Editor: Yun-Gang Liu

Copyright © 2012 Mariusz Głąbowski et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


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.

Autor: Mariusz Głąbowski, Maciej Stasiak, and Joanna Weissenberg



Documentos relacionados