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

DOI10.2307/1427484MaRDI QIDQ4014082zbMATH OpenOpenAlexFDO

Authors Sergej Grishechkin

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 distributionsprocessor sharingtraffic intensityoverloaded queuesCrump-Mode-Jagers branching processheavy traffic theorems

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4201334
• scientific article; zbMATH DE number 822066
• scientific article; zbMATH DE number 4080588
• Scaling limits via excursion theory: interplay between Crump-Mode-Jagers branching processes and processor-sharing queues
• GI/G/1 processor sharing queue in heavy traffic

Cited in

(22)

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

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

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