Cited By
View all- Zhang Z(2009)A note on workload control for an under-utilized server of M/G/1 systemComputers and Industrial Engineering10.1016/j.cie.2008.03.01156:1(28-32)Online publication date: 1-Feb-2009
Performance of the MAP/G/1 queue under the dyadic control of workload and server idleness
Pages 17 - es
Abstract
This paper studies the steady-state queue length process of the MAP/G/1 queue under the dyadic control of the D-policy and the generalized T-policy (multiple server vacations). We derive the probability generating function of the queue length and the mean queue length. Then we verify our analytical results through simulation. We finally present computational experiences and compare the MAP queue with the Poisson queue.
References
[1]
J. R. Artalejo, On the M/G/1 queue with D-policy, Applied Mathematical Modelling, 25: 1055--1069, 2001.
[2]
J. R. Artalejo, A note on the optimality of the N- and D-policies for the M/G/1 queue, Operations Research Letters, 30: 375--376, 2002.
[3]
K. R. Balachandran, Control policies for a single server system, Management Science, 19: 1013--1018, 1973.
[4]
K. R. Balachandran and H. Tijms, On the D-Policy for the M/G/1 queue, Management Science, 21: 1073--1076, 1975.
[5]
O. J. Boxma, Note on a control problem of Balachandran and Tijms, Management Science, 22:916--917, 1976.
[6]
K. C. Chae and Y. I. Park, On the optimal D-policy for the M/G/1 queue, J Korean Institute of Industrial Engineers (KIIE), 25(4): 527--531, 1999.
[7]
K. C. Chae and Y. I. Park, The queue length distribution for the M/G/1 queue under the D-policy, J. Appl. Probab., 38(1): 278--279, 2001.
[8]
J. H. Dshalalow, Queueing processes in bulk systems under the D-policy, J. Appl. Probab., 35: 976--989, 1998.
[9]
U. A. Feinberg and O. Kella, Optimality of D-policies for an M/G/1 queue with a removable server, Queueing Systems, 42: 355--376, 2002.
[10]
G. K. Gakis, H. K. Rhee and B. D. Sivazlian, Distributions and first moments of the busy and idle periods in controllable M/G/1 queueing models with simple and dyadic policies, Stochastic Analysis and Applications, 13(1): 47--81, 1995.
[11]
D. P. Heyman, The T-policy for the M/G/1 queue, Management Science, 23: 775--778, 1977.
[12]
H. W. Lee and K. S. Song, Queue length analysis of MAP/G/1 queue under D-policy, Stochastic Models, 20(3): 363--380, 2004.
[13]
H. W. Lee, S. H. Cheon, E. Y. Lee and K. C. Chae, Workload and waiting time analysis of MAP/G/1 queue under D-policy, Queueing Systems, 48: 421--443, 2004.
[14]
H. W. Lee, S. H. Cheon and W. J. Seo, Queue length and waiting time of the M/G/1 queue under D-policy and multiple vacations, Under revision in Queueing Systems, 2005.
[15]
H. Levy and U. Yechiali, Utilization of idle time in an M/G/1 queueing system, Management Science, 22(2):202--211, 1975.
[16]
J. Li and S. C. Niu, The waiting time distribution for the GI/G/1 queue under the D-policy, Prob. Eng. Inf. Sci., 6: 287--308, 1992.
[17]
R. E. Lillo and M. Martin, On optimal exhaustive policies for the M/G/1 queue, Operations Research Letters, 27: 39--46, 2000.
[18]
D. M. Lucantoni, K. Meier-Hellstern and M. F. Neuts, A single server queue with server vacations and a class of non-renewal arrival process, Adv. Appl. Probab., 22:676--705, 1990.
[19]
D. M. Lucantoni, New results on the single server queue with BMAP, Stochastic Models, 7(1): 1--46, 1991.
[20]
D. M. Lucantoni, The BMAP/G/1 queue: A tutorial, Models and Techniques for Performance Evaluation of Computer and Communications Systems: L. Donatiello and R. Nelson Editors, Springer Verlag, pages 330--358, 1993.
[21]
M. F. Neuts, Matrix-Geometric Solutions in Stochastic Models, The Johns Hopkins University Press, Baltimore and London, 1981.
[22]
M. F. Neuts, Structured stochastic matrices of M/G/1 type and their applications, New York, Marcel Dekker, 1989.
[23]
V. Ramaswami, The N/G/1 queue and its detailed analysis, Adv. Appl. Probab., 12: 222--261, 1980.
[24]
H. K. 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, J Korean Institute of Industrial Engineers (KIIE), 23(4): 729--739, 1997.
[25]
I. Rubin and Z. Zhang, Switch-on policies for communications and queueing systems, Data Communication Systems and Their performance: De Moraes, L. F. M, de Souza e Solva E. and Soares, L. F. G. (Editors), Elsevier Science Publishers B. V. (North-Holland), pages 315--325, 1988.
[26]
B. D. Sivazlian, Approximate optimal solution for a D-policy in an M/G/1 queueing system, AIIE Transactions, 11: 341--343, 1979.
[27]
T. Takine and Y. Takahashi, On the relationship between queue length at a random time and at a departure in the stationary queue with BMAP arrivals, Stochastic Models, 14(3): 601--610, 1998.
[28]
H. C. Tijms, Optimal control of the workload in an M/G/1 queueing system with removable server, Math. Operationsforsch. u. Statist., 7: 933--943, 1976.
[29]
H. C. Tijms, Stochastic Modeling and Analysis : A Computational Approach, John Wiley & Sons, Chichester, 1986.
[30]
H. C. Tijms, A First Course in Stochastic Models, John Wiley & Sons, Chichester, 2003.
[31]
M. Yadin and P. Naor, Queueing systems with a removable server station, Operational Research Quarterly, 14: 393--405, 1963.
Index Terms
- Performance of the MAP/G/1 queue under the dyadic control of workload and server idleness
Recommendations
Workload and Waiting Time Analyses of MAP/G/1 Queue under D-policy
We study the workload (unfinished work) and the waiting time of the queueing system with MAP arrivals under D-policy. The D-policy stipulates that the idle server begin to serve the customers only when the sum of the service times of all waiting ...
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 ...
Performance of the MAP/G/1 Queue Under the Dyadic Control of Workload and Server Idleness
This paper studies the steady-state queue length process of the MAP/G/1 queue under the dyadic control of the D -policy and multiple server vacations. We derive the probability generating function of the queue length and the mean queue length. We then ...
Comments
Information & Contributors
Information
Published In
Copyright © 2006 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 11 October 2006
Check for updates
Author Tags
Qualifiers
- Article
Acceptance Rates
Overall Acceptance Rate 90 of 196 submissions, 46%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 197Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 05 Jan 2025
Other Metrics
Citations
Cited By
View all- Zhang Z(2009)A note on workload control for an under-utilized server of M/G/1 systemComputers and Industrial Engineering10.1016/j.cie.2008.03.01156:1(28-32)Online publication date: 1-Feb-2009
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in