Interoutput times in processor sharing queues with feedback
type: Item
instance of: scholarly article
title: Interoutput times in processor sharing queues with feedback
zbMATH Open document ID: 0661.68035
DOI: 10.1007/BF01157856
author: Georgia-Ann Klutke
author: Ralph L. Disney
author: Peter C. Kiessler
published in: Queueing Systems
publication date: 1988-01-01T00:00:00Z
review text: This paper studies the traffic flows in a processor sharing queue with Poisson input and feedback. The main results show that various flows in infinite server queues are non stationary Poisson processes and that a single server processor sharing queue with constant service requirements exhibits certain stochastic order relations. It should be noted, that equations 2.1 requires a term \(\phi\) (k)! in the denominator. This error is repeated on p. 368.
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 4080904
zbMATH Keywords: traffic flows
zbMATH Keywords: processor sharing
zbMATH Keywords: queues
reviewed by: William Henderson
MaRDI profile type: Publication
cites work: Q5684037
cites work: Q4109064
cites work: Stochastic inequalities on partially ordered spaces
cites work: Q4134686
cites work: Q3678435
cites work: Q3321201
full work available at URL: https://doi.org/10.1007/bf01157856
OpenAlex ID: W1996236297
description: scientific article; zbMATH DE number 4080904