Abstract
This paper considers a discrete-time Geo/G/1 queue under the Min(N,D)-policy in which the idle server resumes its service if either N customers accumulate in the system or the total backlog of the service times of the waiting customers exceeds D, whichever occurs first (Min(N,D)-policy). By using renewal process theory and total probability decomposition technique, the authors study the transient and equilibrium properties of the queue length from the beginning of the arbitrary initial state, and obtain both the recursive expression of the z-transformation of the transient queue length distribution and the recursive formula for calculating the steady state queue length at arbitrary time epoch n +. Meanwhile, the authors obtain the explicit expressions of the additional queue length distribution. Furthermore, the important relations between the steady state queue length distributions at different time epochs n -, n and n + are also reported. Finally, the authors give numerical examples to illustrate the effect of system parameters on the steady state queue length distribution, and also show from numerical results that the expressions of the steady state queue length distribution is important in the system capacity design.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Yadin M and Naor P, Queueing systems with a removable service station, Operational Research Quarterly, 1963, 14: 393–405.
Balachandran K R, Control policies for a single server system, Management Science, 1973, 19: 1013–1018.
Heyman D P, T-policy for the M/G/1 queue, Management Science, 1977, 23: 775–778.
Levy H and Yechiali U, Utilization of idle time in an M/G/1 queueing system, Management Science, 1975, 22(2): 202–211.
Hur S and Paik S J, The effect of different arrival rates on the N-policy of M/G/1 with server setup, Applied Mathematical Modelling, 1999, 23(4): 289–299.
Wang K H and Huang K B, A maximum entropy approach for the p,N-policy M/G/1 queue with a removable and unreliable server, Applied Mathematical Modelling, 2009, 33(4): 2024–2034.
Tang Y H, Pu H, and Yu M M, Queue size of M/G/1 queueing system with N-policy and set-up times, Systems Engineering — Theory & Practice, 2011, 31(1): 131–137 (in Chinese).
Wei Y Y, Tang Y H, and Gu J X, Queue length distribution and numerical calculation for Geo/G/1 queueing system with delayed N-policy, Systems Engineering — Theory & Practice, 2011, 31(11): 2151–2160 (in Chinese).
Wei Y Y, Yu M M, Tang Y H, et al., Queue size distribution and capacity optimum design for N-policy \(Ge{o^{\left( {{\lambda _1},{\lambda _2}{\lambda _3}} \right)}}/G/1\) queue with setup time and variable input rate, Mathematical and Computer Modelling, 2013, 57: 1559–1571.
Luo C Y, Tang Y H, Li W, et al., The recursive solution of queue length for Geo/G/1 queue with N-policy, Journal of Systems Science and Complexity, 2012, 25(2): 293–302.
Lim D E, Lee D H, Yang W S, et al., Analysis of the GI/Geo/1 queue with N-policy, Applied Mathematical Modelling, 2013, 37(7): 4643–4652.
Chae K C and Park Y I, The queue length distribution for the M/G/1 queue under the D-policy, Journal of Applied Probability, 2001, 38(1): 278–297.
Artalejo J R, On the M/G/1 queue with D-policy, Applied Mathematical Modelling, 2001, 25(12): 1055–1069.
Lee H W, Beak J W, and Jeon J, Analysis of the MX/G/1 queue under D-policy, Stochastic Analysis and Applications, 2005, 23(4): 785–808.
Wang K H, Kuo C C, and Ke J C, Optimal control of the D-policy M/G/1 queueing system with server breakdowns, American Journal of Applied Sciences, 2008, 5(5): 565–573.
Lee H W, Kim S A, and Lee S W, Analysis and cost optimization of the M/G/1 queue under the D-policy and LCFS discipline, Stochastic Analysis and Applications, 2008, 26(1): 39–59.
Wei Y Y, Tang Y H, and Gu J X, Queue size distribution and capacity optimum design for Geo/G/1 queueing system with delayed D-policy, Systems Engineering — Theory & Practice, 2013, 33(4): 996–1005 (in Chinese).
Lee H W and Seo W J, The performance of the M/G/1 queue under the dyadic Min(N,D)-policy and its cost optimization, Performance Evaluation, 2008, 65(10): 742–758.
Lee H W, SeoW J, Lee S W, et al., Analysis of the MAP/G/1 queue under the Min(N,D)-policy, Stochastic Models, 2010, 26(1): 98–123.
Tang Y H, WuW Q, and Liu X Y, The queue length distribution of M/G/1 queueing system with Min(N, V)-policy based on multiple server vacations, Systems Engineering — Theory & Practice, 2013, 33(1): 1–14 (in Chinese).
Hunter J J, Mathematical Techniques of Applied Probability, Vol. II, Discrete Time Models: Techniques and Applications, Academic Press, New York, 1983.
Tian N S, Xu X L, and Ma Z Y, Discrete Time Queueing Theory, Peking University Press, Beijing, 2008 (in Chinese).
Luo C Y, Tang Y H, and Liu R B, Transient solution for queue-length distribution of Geometry/G/1 queueing model, Applied Mathematics — A Journal of Chinese Universities, Series B, 2007, 22(1): 95–100.
Author information
Authors and Affiliations
Corresponding author
Additional information
This research was supported by the National Natural Science Foundation of China under Grant Nos. 71171138, 71301111, 71571127, and the Scientific Research Innovation & Application Foundation of Headmaster of Hexi University under Grant Nos. XZ2013-06, XZ2013-09.
This paper was recommended for publication by Editor ZHANG Xun.
Rights and permissions
About this article
Cite this article
Gu, J., Wei, Y., Tang, Y. et al. Queue size distribution of Geo/G/1 queue under the Min(N,D)-policy. J Syst Sci Complex 29, 752–771 (2016). https://doi.org/10.1007/s11424-016-4180-y
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11424-016-4180-y