On sojourn times in the M/M/1-PS model, conditioned on the number of other users
From MaRDI portal
Publication:3558499
Abstract: We consider the -PS queue with processor sharing. We study the conditional sojourn time distribution of an arriving customer, conditioned on the number of other customers present. A new formula is obtained for the conditional sojourn time distribution, using a discrete Green's function. This is shown to be equivalent to some classic results of Pollaczeck and Vaulot from 1946. Then various asymptotic limits are studied, including large time and/or large number of customers present, and heavy traffic, where the arrival rate is only slightly less than the service rate.
Recommendations
- Asymptotic expansions for the conditional sojourn time distribution in the \(M/M/1\)-PS queue
- The conditional sojourn time distribution in the \(GI/M/1\) processor- sharing queue in heavy traffic
- Sojourn time distribution in some processor-shared queues
- Conditional sojourn times of processor-sharing queues
- Asymptotic expansions for the sojourn time distribution in the \(M/G/1\)-PS queue
Cited in
(8)- Explicit formulas for the variance of conditioned sojourn times in \(M/D/1\)-PS
- Conditional sojourn times of processor-sharing queues
- On a processor sharing queue that models balking
- Asymptotic expansions for the conditional sojourn time distribution in the \(M/M/1\)-PS queue
- Sojourn time in an \(\mathrm{M}/\mathrm{M}/1\) processor sharing queue with permanent customers
- Concavity of the conditional mean sojourn time in the \(M/G/1\) processor-sharing queue with batch arrivals
- Conditional Ages and Residual Service Times in the M/G/1 Queue
- Analysis of the M/M/1 queue with processor sharing via spectral theory
This page was built for publication: On sojourn times in the \(M/M/1\)-PS model, conditioned on the number of other users
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3558499)
