Iterative algorithm for blocking probability calculation in Erlang-Engset-Pascal Multi-rate Systems
[ 1 ] Katedra Sieci Telekomunikacyjnych i Komputerowych, Wydział Elektroniki i Telekomunikacji, Politechnika Poznańska | [ P ] pracownik
2007
referat
angielski
- BPP multi-rate traffic
- blocking probability
EN This paper proposes an approximate calculation method of occupancy distribution and blocking probability in systems which are offered multi-service traffic streams generated by Binomial–Poisson–Pascal (BPP) traffic sources. The method is based on transforming a multi-dimensional service process in the system into a one-dimensional Markov chain and on appropriate modification of the generalized Kaufman-Roberts recursion. The proposed algorithm determines the number of sources of particular classes, being serviced in a given state of the system, and subsequently the traffic offered in particular states of the system occupancy. The results of analytical calculations of the blocking probabilities in exemplary systems with BPP traffic streams, obtained on the basis of the proposed method, are compared with the results of the exact Iversen convolution algorithm.
77 - 88