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
Affiliations:
Sungkyunkwan University, Suwon, Korea;Consulting Business Unit, Dongbu Inf. Tech. Co., Ltd., Seoul, Korea;Sungkyunkwan University, Suwon, Korea
Venue:
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Year:
2006

Citing 7
Cited 1

Stochastic modelling and analysis: a computational approach

Stochastic modelling and analysis: a computational approach
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
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

A note on workload control for an under-utilized server of M/G/1 system

Computers and Industrial Engineering

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 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.