Abstract
This paper presents an explicit and straightforward method for finding the sojourn-time distribution of a random customer in an \(M/G^a/1\) queue with a fixed-size batch service. The exhibited process is much more straightforward than the approach discussed by Yu and Tang (Methodology and Computing in Applied Probability 20(4):1503–1514, 2018). We obtain two closed-form expressions for probability density functions by using the inside and outside roots of the underlying characteristic equation. Applying partial fractions and residue theorem, we determine an explicit form of sojourn-time distribution and evaluate the distribution function for any specific time. In illustrative examples, we compare the results obtained by both methods and find that the results match excellently.
Similar content being viewed by others
Availability of Data and Material
Data sharing not applicable to this article as no datasets were generated or analysed during the current study.
References
Akar N (2006) Solving the ME/ME/1 queue with state-space methods and the matrix sign function. Perform Eval 63:131–145
Baetens J, Steyaert B, Claeys D, Bruneel H (2019) Analysis of a batch-service queue with variable service capacity, correlated customer types and generally distributed class-dependent service times. Perform Eval 135:102012
Bailey NT (1954) On queueing processes with bulk service. J Roy Stat Soc: Ser B (Methodol) 16(1):80–87
Botta RF, Harris CM, Marchal WG (1987) Characterizations of generalized hyperexponential distribution functions. Stoch Model 3(1):115–148
Brière G, Chaudhry M (1989) Computational analysis of single-server bulk-service queues, M/GY /1. Adv Appl Probab 21:207–225
Chakravarthy SR, Rumyantsev A et al (2021) Analysis of a queueing model with batch markovian arrival process and general distribution for group clearance. Methodol Comput Appl Probab 23(4):1551–1579
Chaudhry M, Gai J (2012) A simple and extended computational analysis of \({M/G_j^{ (a, b)}/1}\) and \({M/G_j^{ (a, b)}/1/(B+b)}\) queues using roots. INFOR: Information Systems and Operational Research 50(2):72–79
Chaudhry M, Templeton JG (1981) The queuing system M/GB/1 and its ramifications. Eur J Oper Res 6(1):56–60
Chaudhry M, Templeton JG (1983) First course in bulk queues
Chaudhry ML (1992) Numerical issues in computing steady-state queueing-time distributions of single-server bulk-service queues: M/Gb/1 and M/Gd/1. ORSA J Comput 4(3):300–310
Chaudhry ML, Madill B, Briere G (1987) Computational analysis of steady-state probabilities of M/Ga,b/1 and related nonbulk queues. Queueing Systems 2(2):93–114
Claeys D, Walraevens J, Laevens K, Bruneel H (2011) Analysis of threshold-based batch-service queueing systems with batch arrivals and general service times. Perform Eval 68(6):528–549
Downton F (1955) Waiting time in bulk service queues. J Roy Stat Soc: Ser B (Methodol) 17(2):256–261
Downton F (1956) On limiting distributions arising in bulk service queues. J Roy Stat Soc: Ser B (Methodol) 18(2):265–274
Dshalalow JH, Tadj L (1992) A queueing system with a fixed accumulation level, random server capacity and capacity dependent service time. Int J Math Math Sci 15(1):189–194
Horváth G (2016) Analysis of generalized QBD queues with matrix-geometrically distributed batch arrivals and services. Queueing Systems 82(3):353–380
Jain JL, Mohanty SG, Böhm W (2006) A course on queueing models. CRC Press
Juan MT (2006) Numerical method for the single-server bulk-service queuing system with variable service capacity, M/\(G^y\)/1, with discretized service time probability distribution. In: Operations Research Proceedings 2005. Springer, pp 811–816
Kobayashi H, Mark BL, Turin W (2011) Probability, random processes, and statistical analysis: applications to communications, signal processing, queueing theory and mathematical finance. Cambridge University Press
Medhi J (1975) Waiting time distribution in a poisson queue with a general bulk service rule. Manage Sci 21(7):777–782
Medhi J (2002) Stochastic models in queueing theory. Elsevier
Pradhan S, Gupta U (2019) Analysis of an infinite-buffer batch-size-dependent service queue with markovian arrival process. Ann Oper Res 277(2):161–196
Singh G, Gupta U, Chaudhry ML (2014) Analysis of queueing-time distributions for MAP/DN/1 queue. Int J Comput Math 91(9):1911–1930
Tadj L (2003) Explicit solution of a quorum queueing system
Tadj L (2006) Alternative solution to a quorum queueing system. Stoch Anal Appl 24(2):359–365
Yu M, Tang Y (2018) Analysis of the sojourn time distribution for M/GL/1 queue with bulk-service of exactly size l. Methodol Comput Appl Probab 20(4):1503–1514
Zeng Y, Xia CH (2017) Optimal bulking threshold of batch service queues. J Appl Probab 409–423
Acknowledgements
The authors are thankful to the referees for their valuable comments and suggestions. The second author received partial support from CDARP, Canada.
Funding
The second author received partial support from CDARP, Canada.
Author information
Authors and Affiliations
Contributions
Veena Goswami: Conceptualization, Methodology, draft preparation. Mohan Chaudhry: Review & editing, Supervision. Abhijit Datta Banik: Implementation of the computer code and supporting algorithms.
Corresponding author
Ethics declarations
Ethics Approval and Consent to Participate
Not applicable.
Consent for Publication
Not applicable.
Competing Interests
The authors declare that they have no competing interests.
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendix
Appendix
An alternative approach to invert (15) is as follows. If Eq. (15) is put in partial fraction form, it is easy to find inverse Laplace transform. Equation (15) is an improper rational function if the degree of the numerator is greater than the degree of the denominator. In such a case, we divide the numerator by the denominator to make it a proper rational function (Kobayashi et al. (2011)). This leads to
where \(R(s)=\sum \limits _{i=1}^{d} k_i s^i\) is a proper polynomial which can be dealt with by using the transform pair (Dirac delta function) and \(\frac{N_1(s)}{D(s)}\) is a proper rational function which we deal with by using partial fraction, where
Thus,
The constants \(T_i\) can be found as
Let us define the probability density function of the sojourn time to be w(t). Taking the inverse Laplace transforms of Eq. (27), we have
Example 5
We consider the service time distribution as phase-type (PH) having the representation of \(\left( \alpha , \mathbf {T} \right)\) where \(\alpha\) and \(\mathbf {T}\) are assumed as \(\alpha =\begin{pmatrix} 0.25&0.75 \end{pmatrix}, \mathbf {T}=\begin{pmatrix} -1 &{} 0\\ 0 &{} -2 \end{pmatrix}\) with \(\mu =1.6\). The LST \(B^{*}(s)=\mathbf {\alpha }\left( s\ \mathbf {I}-\mathbf {T}\right) ^{-1} \mathbf {T^{o}},~\mathfrak {Re}(s)\ge 0,\) and the other parameters are \(\lambda =6\) and \(a=5\). From the denominator of Eq. (6), the roots outside the unit circle are \(\gamma _1=1.080640\) and \(\gamma _2=1.265010\). The LST of the sojourn time of a random customer is
The probability density function of the sojourn time by taking the inverse Laplace transforms of \(W^{*}(s)\) is
We obtain \(E(W)=2.153832\), which is matching with the result of Yu and Tang (2018). We also check the correctness of the result using the Padé approximation of order [4/5]. Here, we have
From Eq. (17), we obtain
Table 3 presents a cumulative distribution function (CDF) of the sojourn time and compares the results with an alternative method, Padé approximation, and Yu and Tang (2018). We obtain \(E(W)=\int _{0}^{\infty } t \cdot w(t)dt =2.153832\), in both the methods which verifies the correctness of the result.
Rights and permissions
About this article
Cite this article
Goswami, V., Chaudhry, M. & Banik, A.D. Sojourn-time Distribution for \(M/G^a/1\) Queue with Batch Service of Fixed Size - Revisited. Methodol Comput Appl Probab 24, 2897–2912 (2022). https://doi.org/10.1007/s11009-022-09963-0
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11009-022-09963-0