MAP/G/1 Queue Under Workload Control and Postprocessing

Abstract

This article studies the performance of the MAP/G/1 queue under workload control and post processing. We first obtain the probability generating function of the queue length distribution. Then we derive the mean queue length. We present computational experiences and compare the MAP queue with the Poisson queue.

Keywords:

• D-policy
• MAP/G/1
• Single-vacation

Mathematics Subject Classification:

• 60K25

Acknowledgments

This work was supported by the Korea Research Foundation Grant funded by the Korean Government (MOEHRD) (KRF-2005-041-D00889).

The first author is involved in the second phase of the BK-21 (Brain Korea) program funded by the Korean government (MOEHRD).