Analysis of discrete time queues via the reversed process
type: Item
instance of: scholarly article
title: Analysis of discrete time queues via the reversed process
zbMATH Open document ID: 0827.60074
DOI: 10.1007/BF01158776
author: Roy D. Yates
published in: Queueing Systems
publication date: 1995-12-04T00:00:00Z
review text: A class of discrete-time single server queues is considered, where customers arrive in the form of a Bernoulli stream and have service demands with general arithmetic distributions. By way of suitably permuting the positions in queue of the customers present at the end of a time slot, a Markovian state process can be defined which has an invariant measure of product form. This is shown via a study of the time reversed state process.
Mathematics Subject Classification ID: 60K25
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 90B22
zbMATH DE Number: 698864
zbMATH Keywords: cyclic queue
zbMATH Keywords: time reversibility
zbMATH Keywords: round robin queue
zbMATH Keywords: Bernoulli stream
zbMATH Keywords: invariant measure of product form
reviewed by: R. Schaßberger
MaRDI profile type: Publication
cites work: A discrete-time round-robin queue with Bernoulli input and general arithmetic service time distributions
cites work: Insensitivity in discrete time queues with a moving server
cites work: The doubly stochastic server: A time-sharing model
cites work: Q3791100
cites work: Queuing analysis of polling models
description: scientific article; zbMATH DE number 698864