Analysis of discrete-time MAP/G/1 queue under workload control

In this paper, we analyze the discrete-time MAP/G/1 queue under the D-policy in which the idle server resumes its service only when the accumulated workload exceeds the predetermined threshold D. We first derive the probability generating functions of the queue length, workload, waiting time, and sojourn time distributions. Then we derive the mean performance measures. Lastly we present our numerical experience. Through the numerical examples we show the effects of the threshold and the variability of the service times on the mean performance measures, and the effect of the correlation between arrivals.

[1]  Kyung Ho Lee,et al.  Quality‐of‐Service Mechanisms for Flow‐Based Routers , 2008 .

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

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

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

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

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

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

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

[9]  B. Conolly.  Structured Stochastic Matrices of M/G/1 Type and Their Applications , 1991 .

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

[11]  Seok Ho Chang,et al.  On the relationships among queue lengths at arrival, departure, and random epochs in the discrete-time queue with D-BMAP arrivals , 2002, Oper. Res. Lett..

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

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

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

[15]  Sally Floyd,et al.  Wide area traffic: the failure of Poisson modeling , 1995, TNET.

[16]  Jung Woo Baek,et al.  BMAP/G/1 Queue Under D-Policy: Queue Length Analysis , 2005 .

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

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

[19]  Jinoo Joung,et al.  Flow‐Based QoS Management Architectures for the Next Generation Network , 2008 .

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

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

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

[23]  Ariel Orda,et al.  QoS Routing Mechanisms and OSPF Extensions , 1999, RFC.

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

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

[26]  Herwig Bruneel,et al.  Discrete-time models for communication systems including ATM , 1992 .