Processor Sharing Queues with Impatience
Christian H. Gromoll, Philippe Robert, Bert Zwart
Abstract
We investigate a processor sharing queue with renewal arrivals and generally distributed service times. Impatient jobs may abandon the queue, or renege, before completing service. The corresponding stochastic processes are represented by measure valued Markov processes on R2\+. A scaling procedure that gives rise to a fluid model with a nontrivial, yet tractable steady state behavior, is presented. This fluid model model captures many essential features of the underlying stochastic model, and it is used to analyze the impact of impatience in processor sharing queues.
Create a lesson
Related papers
Almost sure exponential stability of multi-dimensional stochastic systems driven by a symmetric α-stable process
Xuekang Zhang, Hongjian Liu, Guangjun Shen
The Arc Threshold of the Two-Row Ising Torus: Exact Factorization, an Algebraic Critical Coupling, Uniformity in the Circumference, and the Rate of Convergence
Marco Mandap
Markovian Lifts and Multifactor Approximations for Weighted Sub-fractional Brownian Motion
J. H. Ramirez-Gonzalez, Edison Cuba
Rényi mixing bounds for kinetic samplers via L2 hypocoercivity
Jianfeng Lu, Yinchen Luo
Bayesian Filters via the Stochastic Category
Kenichi Bannai, Masahiro Kurisaki
Synchronization of Enriched Spin Glasses
Franziska Engler, Justin Ko