Stationary distributions in a queueing system with vacation times and limited service
type: Item
instance of: scholarly article
title: Stationary distributions in a queueing system with vacation times and limited service
zbMATH Open document ID: 0664.60095
DOI: 10.1007/BF01150856
author: S. H. Smith
published in: Queueing Systems
publication date: 1989-01-01T00:00:00Z
review text: This paper deals with a modified M/G/1 queueing system with finite capacity and a walking server. Units waiting are served up to a limited number before the server takes a vacation time and later returns to the queue again. A computational method for the stationary queue length distribution is developed and illustrated with a numerical example. The model was motivated by similar channel access mechanisms in token-ring local area networks.
Mathematics Subject Classification ID: 60K25
Mathematics Subject Classification ID: 90B22
zbMATH DE Number: 4086711
zbMATH Keywords: vacation times
zbMATH Keywords: algorithmic solution
zbMATH Keywords: polling systems
zbMATH Keywords: queueing system with finite capacity
zbMATH Keywords: walking server
zbMATH Keywords: stationary queue length distribution
MaRDI profile type: Publication
cites work: A GI/M/1 queue with rest periods Jacob
cites work: Regenerative Analysis and Steady State Distributions for Markov Chains
cites work: M/G/1/N Queue with Vacation Time and Exhaustive Service Discipline
cites work: Q3923308
cites work: Non-negative matrices and Markov chains. 2nd ed
cites work: Q3791100
full work available at URL: https://doi.org/10.1007/bf01150856
OpenAlex ID: W1983474396
description: scientific article; zbMATH DE number 4086711