z-logo
open-access-imgOpen Access
Complete analysis of MAP/G/1/N queue with single (multiple) vacation(s) under limited service discipline
Author(s) -
Umesh Gupta,
A. D. Banik,
Sunil Pathak
Publication year - 2005
Publication title -
international journal of stochastic analysis
Language(s) - English
Resource type - Journals
eISSN - 2090-3340
pISSN - 2090-3332
DOI - 10.1155/jamsa.2005.353
Subject(s) - algorithm , queue , mathematics , discrete mathematics , computer science , combinatorics , computer network
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 content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom