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 ...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 tile 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, l^trthermore, 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.展开更多
基金supported by the National Natural Science Foundation of China under Grant Nos.71171138,71301111,71571127the Scientific Research Innovation&Application Foundation of Headmaster of Hexi University under Grant Nos.XZ2013-06,XZ2013-09
文摘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 tile 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, l^trthermore, 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.
