GI/G/1 processor sharing queue in heavy traffic

DOI10.2307/1427450zbMath0806.60079OpenAlexW2330970201MaRDI QIDQ4306641

Sergei 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

branching processessojourn timestochastic dominanceinterarrival time distributionprocessor sharing queueing system

Mathematics Subject Classification ID

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

Related Items (10)

Diffusion approximation for a processor sharing queue in heavy traffic. ⋮ Sojourn time distribution in a MAP/M/1 processor-sharing queue ⋮ Stabilizing the virtual response time in single-server processor sharing queues with slowly time-varying arrival rates ⋮ Heavy traffic limit for a processor sharing queue with soft deadlines ⋮ The \(M/G/1\) processor-sharing queue with disasters ⋮ Concavity of the conditional mean sojourn time in the \(M/G/1\) processor-sharing queue with batch arrivals ⋮ PERFORMANCE ESTIMATION OFM/D_K/1 QUEUE UNDER FAIR SOJOURN PROTOCOL IN HEAVY TRAFFIC ⋮ Discriminatory Processor Sharing Queues and the DREB Method ⋮ Steady state approximations of limited processor sharing queues in heavy traffic ⋮ AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue

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