Analysis of the MAP/G/1 Queue Under the Min(N, D)-Policy

In this paper, we consider the queueing system under the MAP (Markovian Arrival process) arrivals and 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 time of the waiting customers exceeds D, whichever occurs first (Min(N, D)-policy). We analyze the queue length, workload, and waiting time. Then, we present numerical examples in which our analytical results are compared with the simulation estimates for verification purposes. We also compare our system with the M/G/1 queue under the same parameter setting and show that a naive Poisson assumption may severely underestimate the mean performance measures.

[1]  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.

[2]  Ho Woo Lee,et al.  Queue length and waiting time of the M/G/1 queue under the D-policy and multiple vacations , 2006, Queueing Syst. Theory Appl..

[3]  Ho Woo Lee,et al.  Performance of the MAP/G/1 Queue Under the Dyadic Control of Workload and Server Idleness , 2006, valuetools '06.

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

[5]  Ho Woo Lee,et al.  Queue Length Analysis of MAP/G/1 Queue Under D-Policy , 2004 .

[6]  Kyung C. Chae,et al.  Workload and Waiting Time Analyses of MAP/G/1 Queue under D-policy , 2004, Queueing Syst. Theory Appl..

[7]  Kyung-Chul Chae,et al.  Analysis of Unfinished Work and Queue Waiting Time for the M/G/1 Queue with D-policy , 2003 .

[8]  Jesus R. Artalejo,et al.  A note on the optimality of the N- and D-policies for the M/G/1 queue , 2002, Oper. Res. Lett..

[9]  Offer Kella,et al.  Optimality of D-Policies for an M/G/1 Queue with a Removable Server , 2002, Queueing Syst. Theory Appl..

[10]  Tetsuya Takine,et al.  A UNIFIED QUEUE LENGTH FORMULA FOR BMAP/G/1 QUEUE WITH GENERALIZED VACATIONS , 2002 .

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

[12]  No Ik Park,et al.  DECOMPOSITIONS OF THE QUEUE LENGTH DISTRIBUTIONS IN THE MAP/G/1 QUEUE UNDER MULTIPLE AND SINGLE VACATIONS WITH N-POLICY , 2001 .

[13]  K. Chae,et al.  The queue length distribution for the M/G/1 queue under the D-policy , 2001 .

[14]  Rosa E. Lillo,et al.  On optimal exhaustive policies for the M/G/1-queue , 2000, Oper. Res. Lett..

[15]  J. Dshalalow.  Queueing processes in bulk systems under the D-policy , 1998, Journal of Applied Probability.

[16]  David M. Lucantoni,et al.  The BMAP/G/1 QUEUE: A Tutorial , 1993, Performance/SIGMETRICS Tutorials.

[17]  Yutaka Takahashi,et al.  Queueing analysis: A foundation of performance evaluation, volume 1: Vacation and priority systems, Part 1: by H. Takagi. Elsevier Science Publishers, Amsterdam, The Netherlands, April 1991. ISBN: 0-444-88910-8 , 1993 .

[18]  Shun-Chen Niu,et al.  The Waiting-Time Distribution for the GI/G/1 Queue under the D-Policy , 1992, Probability in the Engineering and Informational Sciences.

[19]  David Frankel,et al.  brief review: Queueing Analysis: A Foundation of Performance Evaluation. Volume 1: Vacation and Priority Systems, Part 1 by H. Takagi (North-Holland, 1991) , 1991, PERV.

[20]  M. Neuts,et al.  A single-server queue with server vacations and a class of non-renewal arrival processes , 1990, Advances in Applied Probability.

[21]  Onno J. Boxma,et al.  Workloads and waiting times in single-server systems with multiple customer classes , 1989, Queueing Syst. Theory Appl..

[22]  Marcel F. Neuts,et al.  Structured Stochastic Matrices of M/G/1 Type and Their Applications , 1989 .

[23]  Henk Tijms,et al.  Stochastic modelling and analysis: a computational approach , 1986 .

[24]  Jacques Teghem,et al.  Control of the service process in a queueing system , 1986 .

[25]  Sheldon M. Ross,et al.  Stochastic Processes , 2018, Gauge Integral Structures for Stochastic Calculus and Quantum Electrodynamics.

[26]  V. Ramaswami.  The N/G/1 queue and its detailed analysis , 1980, Advances in Applied Probability.

[27]  B. D. Sivazlian.  Approximate Optimal Solution for a D-Policy in an M/G/X Queuing System , 1979 .

[28]  M. Neuts.  A versatile Markovian point process , 1979, Journal of Applied Probability.

[29]  Michael J. Magazine,et al.  A Classified Bibliography of Research on Optimal Design and Control of Queues , 1977, Oper. Res..

[30]  Daniel P. Heyman,et al.  The T-Policy for the M/G/1 Queue , 1977 .

[31]  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..

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

[33]  U. Yechiali,et al.  Utilization of idle time in an M/G/1 queueing system Management Science 22 , 1975 .

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

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

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

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

[38]  Kyung-Chul Chae,et al.  On the Optimal D-Policy for the M/G/1 Queue , 1999 .

[39]  Tetsuya Takine,et al.  On the relationship between queue lengths at a random instant and at a departure in the stationary queue with bmap arrivals , 1998 .

[40]  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 .

[41]  Hideaki Takagi,et al.  Queueing analysis: a foundation of performance evaluation , 1993 .

[42]  David M. Lucantoni,et al.  New results for the single server queue with a batch Markovian arrival process , 1991 .

[43]  Marcel F. Neuts,et al.  Matrix-Geometric Solutions in Stochastic Models , 1981 .

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