Volume 2005, Issue 3 985917 pp. 353-373
Article
Open Access

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

U. C. Gupta

U. C. Gupta

Department of Mathematics Indian Institute of Technology Kharagpur Kharagpur 721302, India , iitkgp.ac.in

Search for more papers by this author
A. D. Banik

A. D. Banik

Department of Mathematics Indian Institute of Technology Kharagpur Kharagpur 721302, India , iitkgp.ac.in

Search for more papers by this author
S. S. Pathak

S. S. Pathak

Department of Electronics and Electrical Communication Engineering Indian Institute of Technology Kharagpur 721302, India , iitkgp.ac.in

Search for more papers by this author
First published: 11 September 2005
Citations: 13

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.

The full text of this article hosted at iucr.org is unavailable due to technical difficulties.