Complete analysis of MAP/G/1/n queue with single (multiple) vacation(s) under limited service discipline

Complete analysis of MAP/G/1/n queue with single (multiple) vacation(s) under limited service discipline

0.00 Avg rating0 Votes
Article ID: iaor20091432
Country: United States
Volume: 2005
Issue: 3
Start Page Number: 353
End Page Number: 373
Publication Date: Sep 2005
Journal: Journal of Applied Mathematics and Stochastic Analysis
Authors: , ,
Keywords: queues: applications, markov processes
Abstract:

We consider a finite-buffer single-server queue with Markovian arrival process (MAP) where the server serves a limited number of customers, and when the limit is reached it goes on vacation. Both single- and multiple-vacation policies are analyzed and the queue length distributions at various epochs, such as pre-arrival, arbitrary, departure, have been obtained. The effect of certain model parameters on some important performance measures, like probability of loss, mean queue lengths, mean waiting time, is discussed. The model can be applied in computer communication and networking, for example, performance analysis of token passing ring of LAN and SVC (switched virtual connection) of ATM.

Reviews

Required fields are marked *. Your email address will not be published.