Stationary distributions in a queueing system with vacation times and limited service (Q1115032): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01150856 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1983474396 / rank
 
Normal rank

Latest revision as of 09:57, 30 July 2024

scientific article
Language Label Description Also known as
English
Stationary distributions in a queueing system with vacation times and limited service
scientific article

    Statements

    Stationary distributions in a queueing system with vacation times and limited service (English)
    0 references
    0 references
    1989
    0 references
    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.
    0 references
    vacation times
    0 references
    algorithmic solution
    0 references
    polling systems
    0 references
    queueing system with finite capacity
    0 references
    walking server
    0 references
    stationary queue length distribution
    0 references

    Identifiers