Processor Sharing Queues with Impatience

DOI10.1287/MOOR.1070.0298arXivmath/0604215MaRDI QIDQ6476993FDOQ6476993

H. Christian Gromoll, Bert Zwart, Philippe Robert

Publication date: 10 April 2006

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 R^2_+. 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.

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Functional limit theorems; invariance principles (60F17) Random measures (60G57) Stochastic network models in operations research (90B15)

This page was built for publication: Processor Sharing Queues with Impatience

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