11th IEEE Symposium on Computers and Communications (ISCC'06) Blocking Probability in a BMAP Queue Cagliari, Sardinia, Italy June 26-June 29 ISBN: 0-7695-2588-1
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISCC.2006.45
In this paper an analysis of the blocking probability in a finite-buffer queue fed by a batchMarkovian arrival process (BMAP) is carried out. In particular, the Laplace transform of the blocking probability is obtained, giving both, timedependent and stationary characteristics. Analytical results are illustrated via numerical calculations. Namely, sample transient and stationary blocking probabilities are shown and the impact of the auto-correlated structure of the arrival process on the blocking probability is presented.
Citation:
Andrzej Chydzinski, Ryszard Winiarczyk, "Blocking Probability in a BMAP Queue," iscc, pp.547-553, 11th IEEE Symposium on Computers and Communications (ISCC'06), 2006 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||