Waiting Time Distributions for Processor-Sharing Systems
Journal of the ACM (JACM)
Insensitivity in processor-sharing networks
Performance Evaluation
Reduced-Load Equivalence and Induced Burstiness in GPS Queues with Long-Tailed Traffic Flows
Queueing Systems: Theory and Applications
A sample path relation for the sojourn times in G/G/1-PS systems and its applications
Queueing Systems: Theory and Applications
Queueing Systems: Theory and Applications
Queueing Systems: Theory and Applications
Processor sharing: A survey of the mathematical theory
Automation and Remote Control
Waiting times for M/M systems under state-dependent processor sharing
Queueing Systems: Theory and Applications
A note on the event horizon for a processor sharing queue
Queueing Systems: Theory and Applications
On sojourn times in M/GI systems under state-dependent processor sharing
Queueing Systems: Theory and Applications
Hi-index | 0.00 |
We deal with additive functionals of stationary processes. It is shown that under some assumptions a stationary model of the time-changed process exists. Further, bounds for the expectation of functions of additive functionals are derived. As an application we analyze virtual sojourn times in an infinite-server system where the service speed is governed by a stationary process. It turns out that the sojourn time of some kind of virtual requests equals in distribution an additive functional of a stationary time-changed process, which provides bounds for the expectation of functions of virtual sojourn times, in particular bounds for fractional moments and the distribution function. Interpreting the GI(n)/GI(n)/∞ system or equivalently the GI(n)/GI system under state-dependent processor sharing as an infinite-server system where the service speed is governed by the number n of requests in the system provides results for sojourn times of virtual requests. In the case of M(n)/GI(n)/∞, the sojourn times of arriving and added requests equal in distribution sojourn times of virtual requests in modified systems, which yields several results for the sojourn times of arriving and added requests. In case of positive integer moments, the bounds generalize earlier results for M/GI(n)/∞. In particular, the mean sojourn times of arriving and added requests in M(n)/GI(n)/∞ are proportional to the required service time, generalizing Cohen's famous result for M/GI(n)/∞.