Analysis of an ND-policy Geo/G/1 queue and its application to wireless sensor networks

AbstractIn this paper, we consider a discrete-time Geo/G/1 queue controlled by the combination of the N and D policies (called ND-policy). In this system, when there are N waiting customers or the service time backlog of all waiting customers exceeds a given threshold D, whichever emerges first, the idle server immediately resumes its service. Under this policy, since the service times of the customers arriving during the idle period, conditioned on the number of these customers, are dependent, and stochastically different from the service times of the customers arriving during the busy period, the customers in the system are classified into two types. Based on this classification, we first derive the probability generating functions and means of the queue length, idle and busy periods, service time backlog, waiting time and sojourn time, where the busy period is first studied in the discrete-time queues involving the D-policy. Next, by analyzing some results and flaws in the work of Gu et al. (J Syst Sci Complex, 2016. doi:10.1007/s11424-016-4180-y), we theoretically show the discrepancies that could arise if the conditional dependency of the service times of the customers arriving during the idle period is ignored. Finally, the numerical examples are provided to study the effects of different parameters on the mean queue length. Through an energy consumption optimization problem in wireless sensor networks, the application of our queueing model in the real world is illustrated, and the flaws that resulted from the results by Gu et al. (J Syst Sci Complex, 2016. doi:10.1007/s11424-016-4180-y) are numerically revealed.

[1]  Pilar Moreno,et al.  Analysis of a Geo/G/1 Queueing System with a Generalized N-Policy and Setup-Closedown Times , 2008 .

[2]  V. Balachandran,et al.  Comment on “Solving the 'Marketing Mix' Problem using Geometric Programming” , 1975 .

[3]  Jau-Chuan Ke,et al.  The randomized threshold for the discrete-time Geo/G/1 queue , 2009 .

[4]  Alfredo García Hernández-Díaz,et al.  A discrete-time single-server queueing system with an N-policy, an early setup and a generalization of the Bernoulli feedback , 2009, Math. Comput. Model..

[5]  Henk C. Tijms,et al.  On a switch-over policy for controlling the workload in a queueing system with two constant service rates and fixed switch-over costs , 1977, Math. Methods Oper. Res..

[6]  Yinghui Tang,et al.  Analysis of a discrete-time $$Geo^{\lambda _1,\lambda _2}/G/1$$Geoλ1,λ2/G/1 queue with N-policy and D-policy , 2017 .

[7]  Jesús R. Artalejo,et al.  On the M/G/1 queue with D-policy , 2001 .

[8]  J. George Shanthikumar.  On Stochastic Decomposition in M/G/1 Type Queues with Generalized Server Vacations , 1988, Oper. Res..

[9]  Won Seok Yang,et al.  The N-policy of a discrete time Geo/G/1 queue with disasters and its application to wireless sensor networks , 2013 .

[10]  Gautam Choudhury,et al.  Optimal design and control of queues , 2005 .

[11]  Jewgeni H. Dshalalow.  Queueing processes in bulk systems under the D-policy , 1998 .

[12]  Won Joo Seo,et al.  Analysis of the MAP/G/1 Queue Under the Min(N, D)-Policy , 2010 .

[13]  Ho Woo Lee,et al.  A Unified Framework for the Analysis of M/G/1 Queue Controlled by Workload , 2006, ICCSA.

[14]  Kashi R. Balachandran,et al.  Control Policies for a Single Server System , 1973 .

[15]  Pilar Moreno.  A discrete-time single-server queue with a modified N -policy , 2007, Int. J. Syst. Sci..

[16]  Ravi P. Agarwal,et al.  New fluctuation analysis of D-policy bulk queues with multiple vacations , 2005, Math. Comput. Model..

[17]  Yinghui Tang,et al.  Queue size distribution of Geo/G/1 queue under the Min(N,D)-policy , 2016, J. Syst. Sci. Complex..

[18]  Ho Woo Lee,et al.  Analysis of discrete-time Geo/G/1 queue under the D-policy , 2011, QTNA.

[19]  Se Won Lee,et al.  Analysis of discrete-time MAP/G/1 queue under workload control , 2012, Perform. Evaluation.

[20]  O. J. Boxma,et al.  Note---Note on a Control Problem of Balachandran and Tijms , 1976 .

[21]  Chao-Tung Yang,et al.  Lifetime elongation for wireless sensor network using queue-based approaches , 2010, The Journal of Supercomputing.

[22]  M. Yadin,et al.  Queueing Systems with a Removable Service Station , 1963 .

[23]  Panagiotis Kasteridis,et al.  On the d-policy for the m/g/1 queue , 2001 .

[24]  Dae-Eun Lim,et al.  Analysis of the GI/Geo/1 queue with N-policy , 2013 .

[25]  B. D. Sivazlian,et al.  Distributions and first moments of the busy and idle periods in controllable M/G/1 Queueing Models with Simple and Dyadic Policies , 1995 .

[26]  Yinghui Tang,et al.  Queue size distribution and capacity optimum design for N-policy Geo(λ1, λ2, λ3)/G/1 queue with setup time and variable input rate , 2013, Math. Comput. Model..

[27]  Jewgeni H. Dshalalow.  On applications of excess level processes to ( N , D ) -policy bulk queueing systems , 1996 .

[28]  Wei Li,et al.  The recursive solution of queue length for Geo/G/1 queue with N-policy , 2012, J. Syst. Sci. Complex..

[29]  Robert B. Cooper,et al.  Stochastic Decompositions in the M/G/1 Queue with Generalized Vacations , 1985, Oper. Res..

[30]  Hahn-Kyou Rhee.  Development of a New Methodology to find the Expected Busy Periods for Controllable M/G/1 Queueing Models Operating under the Multi-variable Operating Policies: Concepts and applications to the dyadic policies , 1997 .

[31]  H. C. Tijms,et al.  Optimal control of the workload in an m/g/1 queueing system with removable server , 1975 .

[32]  Won Joo Seo,et al.  The performance of the M/G/1 queue under the dyadic I-policy and its cost optimization , 2008, Perform. Evaluation.