Insensitive Bounds for the Moments of the Sojourn Times in M/GI Systems Under State-Dependent Processor Sharing
DOI10.1239/aap/1269611152zbMath1197.60085MaRDI QIDQ3566401
Manfred Brandt, Andreas Brandt
Publication date: 7 June 2010
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1239/aap/1269611152
moments; Laplace-Stieltjes transform; conditional sojourn time; state-dependent processor sharing; many servers; general service time; Poisson arrival; conditional waiting time; insensitive bounds; Cohen's generalized processor sharing; M/GI/m-PS
60E15: Inequalities; stochastic orderings
60G10: Stationary stochastic processes
60K25: Queueing theory (aspects of probability theory)
90B22: Queues and service in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Processor sharing: a survey of the mathematical theory
- Waiting times for \(M/M\) systems under state-dependent processor sharing
- Processor-sharing queues: Some progress in analysis
- The \(M/G/1\) queue with processor sharing and its relation to a feedback queue
- Mathematical problems in the theory of processor-sharing queueing systems
- The multiple phase service network with generalized processor sharing
- Reduced-load equivalence and induced burstiness in GPS queues with long-tailed traffic flows
- On sojourn times in \(M/GI\) systems under state-dependent processor sharing
- Insensitive bounds for the moments of the sojourn time distribution in the \(M/G/1\) processor-sharing queue
- The sojourn-time distribution in the M/G/1 queue by processor sharing
- Waiting time distributions for M/M/N processor sharing queues
- Generalized processor sharing queues with heterogeneous traffic classes
- Insensitivity in processor-sharing networks
- Tail asymptotics for processor-sharing queues
- A Note on Insensitivity in Stochastic Networks
- Time-shared Systems
- Waiting Time Distributions for Processor-Sharing Systems