Stability of a processor sharing queue with varying throughput
classification
🧮 math.PR
keywords
customersprocessorsharingstabilitysystemthroughputcasescriterion
read the original abstract
In this paper, we present a stability criterion for Processor Sharing queues, in which the throughput may depend on the number of customers in the system (in such cases such as interferences between the users). Such a system is represented by a point measure-valued stochastic recursion keeping track of the remaining processing times of the customers.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.