Abstract
We consider a MAP/PH/1-type queueing system with server vacations as a model that is useful for the analysis of multiple access systems with polling discipline without transmission interruption. Vacation of the server corresponds to the service providing competitive information flows to the polling system. In this paper, we consider a vacation queueing model under pretty general assumptions about the probabilistic distributions describing the behavior of the system and the realistic assumption, in many real-world systems, that ongoing service cannot be terminated ahead of schedule. We derive the criterion of the stable operation of the system and the stationary distributions of the system states and the waiting time. An illustrative numerical example is presented.
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference25 articles.
1. Polling: past, present, and perspective
2. Mathematical methods to study the polling systems
3. Polling Systems and Their Application to Telecommunication Networks
4. Queueing Analysis of Polling Models: And update, Stochastic Analysis of Computer and Communication Systems;Takagi,1990
5. Queueing Analysis of Polling Models: Progress in 1990–1994, Frontiers in Queueing;Takagi,1997