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

DOI10.1239/aap/1269611152zbMath1197.60085OpenAlexW2080101319MaRDI QIDQ3566401

Andreas Brandt, Manfred Brandt

Publication date: 7 June 2010

Published in: Unnamed Author (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1239/aap/1269611152

zbMATH Keywords

momentsLaplace-Stieltjes transformconditional sojourn timestate-dependent processor sharingmany serversgeneral service timePoisson arrivalconditional waiting timeinsensitive boundsCohen's generalized processor sharingM/GI/m-PS

Mathematics Subject Classification ID

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

Related Items (3)

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

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

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