On a relationship between processor-sharing queues and Crump–Mode–Jagers branching processes

DOI10.2307/1427484zbMath0757.60095OpenAlexW2325425422MaRDI QIDQ4014082

Publication date: 4 October 1992

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

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

zbMATH Keywords

stationary distributions processor sharing traffic intensity overloaded queues Crump-Mode-Jagers branching process heavy traffic theorems

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

Related Items (20)

Markov-modulated \(\mathrm{M}/\mathrm{G}/1\)-type queue in heavy traffic and its application to time-sharing disciplines ⋮ Semi-linear stochastic difference equations ⋮ Tail behavior of conditional sojourn times in processor-sharing queues ⋮ Asymptotic expansions of defective renewal equations with applications to perturbed risk models and processor sharing queues ⋮ Central limit theorem for supercritical binary homogeneous Crump-Mode-Jagers processes ⋮ Scaling limits via excursion theory: interplay between Crump-Mode-Jagers branching processes and processor-sharing queues ⋮ Analysis of the M/G/1 processor-sharing queue with bulk arrivals ⋮ Processor sharing: a survey of the mathematical theory ⋮ Expected waiting time in symmetric polling systems with correlated walking times ⋮ Applying Branching Processes to Delay-Tolerant Networks ⋮ Heavy-traffic limits for discriminatory processor sharing models with joint batch arrivals ⋮ SOJOURN TIMES IN NON-HOMOGENEOUS QBD PROCESSES WITH PROCESSOR SHARING ⋮ The \(M/G/1\) processor-sharing queue with disasters ⋮ Splitting Trees Stopped when the First Clock Rings and Vervaat's Transformation ⋮ Discrete-time \(MAP/G/1/\infty\) system with inversive probabilistic servicing discipline ⋮ Insensitive bounds for the moments of the sojourn time distribution in the \(M/G/1\) processor-sharing queue ⋮ A survey on discriminatory processor sharing ⋮ AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue ⋮ BMAP/G/1/\(\infty \) system with last come first served probabilistic priority ⋮ The M/G/1 processor-sharing model: Transient behavior

This page was built for publication: On a relationship between processor-sharing queues and Crump–Mode–Jagers branching processes