Abstract
This paper presents a simple procedure to evaluate the actual waiting-time distributions for the first- and an arbitrary-customer of an arrival batch in the D-BMAP/G / 1 queueing system. The analysis is based on the remaining service time as the supplementary variable and the roots of the associated characteristic equation of the vector-generating function of the actual waiting-time distribution. Numerical aspects have been tested for a variety of service-time distribution and a sample of numerical outputs is presented.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Akar, N., & Arikan, E. (1996). A numerically efficient method for the \(MAP/D/1/K\) queue via rational approximations. Queueing Systems, 22(1), 97–120.
Blondia, C., & Casals, O. (1992). Statistical multiplexing of VBR sources: A matrix-analytic approach. Performance Evaluation, 16(1–3), 5–20.
Bruneel, H., & Kim, B. G. (1993). Discrete-time models for communication systems including ATM. Boston: Kluwer.
Chaudhry, M. L., Harris, C. M., & Marchal, W. G. (1990). Robustness of rootfinding in single-server queueing models. INFORMS Journal on Computing, 2, 273–286.
Chaudhry, M. L., Singh, G., & Gupta, U. C. (2013). A simple and complete computational analysis of \(MAP/R/1\) queue using roots. Methodology and Computing in Applied Probability, 15(3), 563–582.
Frigui, I., Alfa, A. S., & Xu, X. (1997). Algorithms for computing waiting time distributions under different queue disciplines for the \(D\)-\(BMAP/PH/1\). Naval Research Logistics, 44, 559–576.
Gail, H. R., Hantler, S. L., & Taylor, B. A. (1996). Spectral analysis of \(M/G/1\) and \(G/M/1\) type Markov chains. Advances in Applied Probability, 28, 114–165.
Gravey, A., & Hébuterne, G. (1992). Simultaneity in discrete time single server queues with Bernoulli inputs. Performance Evaluation, 14, 123–131.
Heffes, H., & Lucantoni, D. M. (1986). A Markov modulated characterization of packetized voice and data traffic and related statistical multiplexer performance. IEEE Journal of Selected Areas in Communications, 4(6), 856–868.
Hofkens, T., Spaey, K., & Blondia, C. (2004). Transient analysis of the \(D\) queue with an application to the dimensioning of a playout buffer for VBR video. Networking 2004. LNCS 3042, pp. 1338–1343.
Hunter, J. J. (1983). Mathematical techniques of applied probability, discrete-time models: Techniques and applications (Vol. II). New York: Academic Press.
Janssen, A., & Leeuwaarden, J. (2005). Analytic computation schemes for the discrete time bulk service queue. Queueing Systems, 50, 141–163.
Kang, S., Sung, D., & Choi, B. (1998). An empirical real-time approximation of waiting time distribution in \(MMPP(2)/D/1\). IEEE Communications Letters, 2(1), 17–19.
Katehakis, M. N., & Smit, L. C. (2012). A successive lumping procedure for a class of Markov chains. Probability in the Engineering and Informational Sciences, 26(04), 483–508.
Katehakis, M. N., Smit, L. C., & Spieksma, F. M. (2015). DES and RES processes and their explicit solutions. Probability in the Engineering and Informational Sciences, 29(02), 191–217.
Lee, H. W., Moon, J. M., Kim, B. K., Park, J. G., & Lee, S. W. (2005). A simple eigenvalue method for low-order \(D\)-\(BMAP/G/1\) queues. Applied Mathematical Modelling, 29, 277–288.
Lucantoni, D. M. (1991). New results on the single server queue with a batch Markovian arrival process. Stochastic Models, 7(1), 1–46.
Nishimura, S. (2000). A spectral analysis for a \(MAP/D/N\) queue. In G. Latouche & P. Taylor (Eds.), Advances in algorithmic methods for stochastic models (pp. 279–294). New Jersey: Notable Publications.
Nishimura, S., Tominaga, H., & Shigeta, T. (2006). A computational method for the boundary vector of a \(BMAP/G/1\) queue. Journal of the Operations Research Society of Japan, 49(2), 83–97.
Ozawa, T. (2006). Sojourn time distributions in the queue defined by a general QBD process. Queueing Systems, 53(4), 203–211.
Ramaswami, V. (1980). The \(N/G/1\) queue and its detailed analysis. Advances in Applied Probability, 12(1), 222–261.
Singh, G., Chaudhry, M. L., & Gupta, U. C. (2012). Computing system-time and system-length distributions for \(MAP/D/1\) queue using distributional Little’s law. Performance Evaluation, 69, 102–118.
Takine, T. (2000). A simple approach to the \(MAP/D/s\) queue. Stochastic Models, 16(5), 543–556.
Tijms, H. C. (2003). A first course in stochastic models. New York: Wiley.
Turck, K. D., Vuyst, S. D., Fiems, D., Bruneel, H., & Wittevrongel, S. (2013). Efficient performance analysis of newly proposed sleep-mode mechanisms for IEEE 802.16m in case of correlated downlink traffic. Wireless Networks, 19(5), 831–842.
Zhao, J. A., Li, B., Kok, C. W., & Ahmad, I. (2004). MPEG-4 video transmission over wireless networks: A link level performance study. Wireless Networks, 10(2), 133–146.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Samanta, S.K. Waiting-time analysis of D-\({ BMAP}{/}G{/}1\) queueing system. Ann Oper Res 284, 401–413 (2020). https://doi.org/10.1007/s10479-015-1974-6
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-015-1974-6