On the blocking probability in batch Markovian arrival queues
Pages 45 - 52
Abstract
In this paper we investigate the blocking probability in a finite-buffer queue whose arrival process is given by the batch Markovian arrival process (BMAP). BMAP generalizes a wide set of Markovian processes and is especially useful as a precise model of aggregated IP traffic. We first give a detailed description of the BMAP, next we prove a formula for the transform of the blocking probability and show how time-dependent and stationary characteristics can be obtained by means of this formula. Then we discuss the computational complexity and other computational issues. Finally, we present a set of numerical results for two different BMAP parameterizations. In particular, we show sample transient and stationary blocking probabilities and the impact of the auto-correlated structure of the arrival process on the blocking probability.
References
[1]
A. Chydzinski, Delay analysis in a BMAP queue, in: Proc. of 13-th Int. Conf. Telecommun. Funchal, Portugal, 2006.
[2]
Leland, W., Taqqu, M., Willinger, W. and Wilson, D., On the self-similar nature of ethernet traffic (extended version). IEEE/ACM Trans. Netw. v2 i1. 1-15.
[3]
Crovella, M. and Bestavros, A., Self-similarity in world wide web traffic: Evidence and possible causes. IEEE/ACM Trans. Netw. v5 i6. 835-846.
[4]
Andersen, A. and Nielsen, B., A Markovian approach for modeling packet traffic with long-range dependence. IEEE J. Selected Areas Commun. v16 i5. 719-732.
[5]
Li, S. and Hwang, C., On the convergence of traffic measurement and queuing analysis: A statistical match and queuing (SMAQ) tool. IEEE/ACM Trans. Netw. 95-110.
[6]
Robert, S. and Le Boudec, J., New models for self-similar traffic. Perform. Evaluation. v30 i1/2. 57-68.
[7]
Shah-Heydari, S. and Le-Ngoc, T., MMPP models for multimedia traffic. Telecommun. Syst. v15 i3-4. 273-293.
[8]
Salvador, P., Pacheco, A. and Valadas, R., Modeling IP traffic: joint characterization of packet arrivals and packet sizes using BMAPs. Computer Netw. v44. 335-352.
[9]
Klemm, A., Lindemann, C. and Lohmann, M., Modeling IP traffic using the batch Markovian arrival process. Perform. Evaluation. v54 i2. 149-173.
[10]
Landman, J. and Kritzinger, P., Delay analysis of downlink IP traffic on UMTS mobile networks. Perform. Evaluation. v62. 68-82.
[11]
Ramaswami, V., The N/G/1 queue and its detailed analysis. Adv. Appl. Prob. v12. 222-261.
[12]
Lucantoni, D.M., New results on the single server queue with a batch Markovian arrival process. Commun. Stat. Stoch. Models. v7 i1. 1-46.
[13]
Lucantoni, D.M., Choudhury, G.L. and Whitt, W., The transient BMAP/G/1 queue. Commun. Stat. Stoch. Models. v10 i1. 145-182.
[14]
Lucantoni, D., Further transient analysis of the BMAP/G/1 queue. Commun. Stat. Stoch. Models. v14 i1-2. 461-478.
[15]
Blondia, C., The finite capacity N/G/1 queue. Commun. Statistics: Stoch. Models. v5 i2. 273-294.
[16]
Gouweleeuw, F.N., Calculating the loss probability in a BMAP/G/1/N+1 queue. Commun. Stat. Stoch. Models. v12 i3. 473-492.
[17]
Neuts, M.F., A versatile Markovian point process. J. Appl. Probab. v14. 764-779.
[18]
Chydzinski, A., The oscillating queue with finite buffer. Perform. Evaluation. v57/3. 341-355.
[19]
Fischer, W. and Meier-Hellstern, K., The Markov-modulated Poisson process (MMPP) cookbook. Perform. Evaluation. v18 i2. 149-171.
[20]
Abate, J. and Whitt, W., The Fourier-series method for inverting transforms of probability distributions. Queueing Syst. v10. 5-88.
[21]
Abate, J., Choudhury, G.L. and Whitt, W., On the Laguerre method for numerically inverting Laplace transforms. INFORMS J. Comput. v8. 413-427.
[22]
Davies, B. and Martin, B.L., Numerical inversion of the Laplace transform: A survey and comparison of methods. J. Comp. Phys. v33. 1-32.
[23]
S. Iyer, R.R. Kompella, N. McKeown, Analysis of a memory architecture for fast packet buffers, in: Proc. of IEEE High Performance Switching and Routing, Dallas, Texas, 2001.
[24]
<http://www.omnetpp.org/>.
Index Terms
- On the blocking probability in batch Markovian arrival queues
Recommendations
Stationary distributions and optimal control of queues with batch Markovian arrival process under multiple adaptive vacations
We consider an infinite-buffer single server queue with batch Markovian arrival process (BMAP) and exhaustive service discipline under multiple adaptive vacation policy. That is, the server serves until system emptied and after that server takes a ...
Discrete-time single-server finite-buffer queues under discrete Markovian arrival process with vacations
This paper treats a discrete-time single-server finite-buffer exhaustive (single- and multiple-) vacation queueing system with discrete-time Markovian arrival process (D-MAP). The service and vacation times are generally distributed random variables and ...
Note on batch arrival LCFS and related symmetric queues
We consider insensitve aspects of batch arrival LCFS-P/R and related symmetric queues. New types of insensitive distributions are obtained for the queue length when the batch arrival processes are Poisson. For the LCFS-P/R GI^X/GI/1 queue, simple ...
Comments
Information & Contributors
Information
Published In
Copyright © Elsevier B.V. © 2007.
Publisher
Elsevier Science Publishers B. V.
Netherlands
Publication History
Published: 01 February 2008
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 12 Nov 2024
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in