Performance of the MAP/G/1 Queue Under the Dyadic Control of Workload and Server Idleness

Authors:
Ho Woo Lee;Sahng Hoon Cheon;Se Won Lee;Jung Woo Baek
Affiliations:
Department of Systems Management Engineering, Sungkyunkwan University, Suwon, South Korea;Consulting Business Unit, Dongbu Information Technology. Co., Ltd., Seoul, South Korea;Department of Systems Management Engineering, Sungkyunkwan University, Suwon, South Korea;Department of Systems Management Engineering, Sungkyunkwan University, Suwon, South Korea
Venue:
Discrete Event Dynamic Systems
Year:
2008

Citing 9
Cited 0

Stochastic modelling and analysis: a computational approach

Stochastic modelling and analysis: a computational approach
On stochastic decomposition in M/G/1 type queues with generalized server vacations

Operations Research
Optimality of D-Policies for an M/G/1 Queue with a Removable Server

Queueing Systems: Theory and Applications
The BMAP/G/1 QUEUE: A Tutorial

Performance Evaluation of Computer and Communication Systems, Joint Tutorial Papers of Performance '93 and Sigmetrics '93
Workload and Waiting Time Analyses of MAP/G/1 Queue under D-policy

Queueing Systems: Theory and Applications
Queue length and waiting time of the M/G/1 queue under the D-policy and multiple vacations

Queueing Systems: Theory and Applications
A unified framework for the analysis of m/g/1 queue controlled by workload

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
On optimal exhaustive policies for the M/G/1-queue

Operations Research Letters
A note on the optimality of the N- and D-policies for the M/G/1 queue

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

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 multiple server vacations. We derive the probability generating function of the queue length and the mean queue length. We then present computational experiences and compare the MAP queue with the Poisson queue.