Insensitive Bounds for the Moments of the Sojourn Times in M/GI Systems Under State-Dependent Processor Sharing

DOI10.1239/AAP/1269611152MaRDI QIDQ3566401zbMATH OpenOpenAlexFDO

Authors Andreas Brandt, Manfred 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

zbMATH Keywords

momentsLaplace-Stieltjes transformconditional sojourn timemany serversstate-dependent processor sharinggeneral service timePoisson arrivalconditional waiting timeinsensitive boundsCohen's generalized processor sharingM/GI/m-PS

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Queues and service in operations research (90B22) Stationary stochastic processes (60G10) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• 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
• Waiting times for \(M/M\) systems under state-dependent processor sharing
• Sojourn time asymptotics in the M/G/1 processor sharing queue
• The Conditional Sojourn Time Distribution in the GI/M/1 Processor-Sharing Queue in Heavy Traffic
• scientific article; zbMATH DE number 3972594
• An approximation for the sojourn-time distribution for the gi/g/1 processor-sharing queue

Cites work

• scientific article; zbMATH DE number 4137158 (Why is no real title available?)
• scientific article; zbMATH DE number 3823138 (Why is no real title available?)
• scientific article; zbMATH DE number 3613366 (Why is no real title available?)
• A Note on Insensitivity in Stochastic Networks
• Generalized processor sharing queues with heterogeneous traffic classes
• Insensitive bounds for the moments of the sojourn time distribution in the \(M/G/1\) processor-sharing queue
• Insensitivity in processor-sharing networks
• Mathematical problems in the theory of processor-sharing queueing systems
• On sojourn times in M/GI systems under state-dependent processor sharing
• Processor sharing: a survey of the mathematical theory
• Processor-sharing queues: Some progress in analysis
• Reduced-load equivalence and induced burstiness in GPS queues with long-tailed traffic flows
• Tail asymptotics for processor-sharing queues
• The M/G/1 queue with processor sharing and its relation to a feedback queue
• The multiple phase service network with generalized processor sharing
• The sojourn-time distribution in the M/G/1 queue by processor sharing
• Time-shared Systems
• Waiting Time Distributions for Processor-Sharing Systems
• Waiting time distributions for M/M/N processor sharing queues
• Waiting times for \(M/M\) systems under state-dependent processor sharing

Cited in

(4)

• Waiting times for \(M/M\) systems under state-dependent processor sharing
• On busy period and sojourn time distributions in the M/G/1-EPS queue with catastrophes
• On sojourn times in M/GI systems under state-dependent processor sharing
• Additive functionals with application to sojourn times in infinite-server and processor sharing systems

This page was built for publication: Insensitive Bounds for the Moments of the Sojourn Times in M/GI Systems Under State-Dependent Processor Sharing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3566401)