GI/G/1 processor sharing queue in heavy traffic

DOI10.2307/1427450MaRDI QIDQ4306641zbMATHOpenAlexFDO

Authors S. Grishechkin

Publication date 12 February 1995

Published in Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/1427450

zbMATH Keywords

stochastic dominancebranching processessojourn timeinterarrival time distributionprocessor sharing queueing system

Mathematics Subject Classification ID

Applications of branching processes (60J85) Queueing theory (aspects of probability theory) (60K25) Random measures (60G57) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

Recommendations

• The gi/m/1 processor-sharing queue and its heavy traffic analysis
• The conditional sojourn time distribution in the \(GI/M/1\) processor- sharing queue in heavy traffic
• Asymptotic approximations for the gi/m/1 queue with processor-sharing service
• On a heavy traffic limit theorem for the M/G/1 processor-sharing queue

Cited in

(25)

• Discriminatory Processor Sharing Queues and the DREB Method
• Tail asymptotics for processor-sharing queues
• An approximation for the sojourn-time distribution for the gi/g/1 processor-sharing queue
• The \(M/G/1\) processor-sharing queue with disasters
• On the influence of high priority customers on a generalized processor sharing queue
• Sojourn time distribution in a MAP/M/1 processor-sharing queue
• Heavy traffic limit for a processor sharing queue with soft deadlines
• PERFORMANCE ESTIMATION OFM/D_K/1 QUEUE UNDER FAIR SOJOURN PROTOCOL IN HEAVY TRAFFIC
• A cost-equation analysis of general-input general-service processor sharing system
• The sojourn time in the GI/M/1 queue by processor sharing
• Stabilizing the virtual response time in single-server processor sharing queues with slowly time-varying arrival rates
• Diffusion approximation for a processor sharing queue in heavy traffic.
• Achievable performance of blind policies in heavy traffic
• Heavy-traffic analysis of sojourn time under the foreground-background scheduling policy
• Concavity of the conditional mean sojourn time in the \(M/G/1\) processor-sharing queue with batch arrivals
• PROCESSOR SHARING G-QUEUES WITH INERT CUSTOMERS AND CATASTROPHES: A MODEL FOR SERVER AGING AND REJUVENATION
• On a heavy traffic limit theorem for the M/G/1 processor-sharing queue
• scientific article; zbMATH DE number 1738620 (Why is no real title available?)
• Interoutput times in processor sharing queues with feedback
• Scaling limits via excursion theory: interplay between Crump-Mode-Jagers branching processes and processor-sharing queues
• AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue
• On a relationship between processor-sharing queues and Crump–Mode–Jagers branching processes
• Steady state approximations of limited processor sharing queues in heavy traffic
• On the transient behavior of the processor sharing queue
• scientific article; zbMATH DE number 4080588 (Why is no real title available?)

This page was built for publication: GI/G/1 processor sharing queue in heavy traffic

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