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 present computational experiences and compare the MAP queue with the Poisson queue.
KeywordsMAP/G/1 queue Dyadic control Workload and server idleness
Unable to display preview. Download preview PDF.
- Lucantoni DM (1993) Models and techniques for performance evaluation of computer and communications systems. In: Donatiello L, Nelson R (eds) The BMAP/G/1 queue: a tutorial. Springer, pp 330–358Google Scholar
- Rhee HK (1997) 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 Inst Ind Eng (KIIE) 23(4):729–739Google Scholar
- Rubin I, Zhang Z (1988) Switch-on policies for communications and queueing systems. De Moraes LFM, de Souza e Solva E, Soares LFG (eds) Data communication systems and Their performance. Elsevier Science (North-Holland), pp 315–325Google Scholar
- Sivazlian BD (1979) Approximate optimal solution for a D-policy in an M/G/1 queueing system. AIIE Trans 11:341–343Google Scholar
- Tijms HC (1986) Stochastic modeling and analysis: a computational approach. Wiley, ChichesterGoogle Scholar