Fluid Limits for Processor-Sharing Queues with Impatience
Authors:
- 1 May 2008
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
- Vol. 33 (2) , 375-402
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 random time representing a job's patience has a general distribution and may be dependent on its initial service time requirement. A scaling procedure that gives rise to a fluid model with nontrivial yet tractable steady state behavior is presented. This fluid model captures many essential features of the underlying stochastic model, and it is used to analyze the impact of impatience in processor-sharing queues.Keywords
This publication has 24 references indexed in Scilit:
- Heavy traffic limit for a processor sharing queue with soft deadlinesThe Annals of Applied Probability, 2007
- Accuracy of state space collapse for earliest-deadline-first queuesThe Annals of Applied Probability, 2006
- Fluid model for a network operating under a fair bandwidth-sharing policyThe Annals of Applied Probability, 2004
- Tail asymptotics for processor-sharing queuesAdvances in Applied Probability, 2004
- Real-time queues in heavy traffic with earliest-deadline-first queue disciplineThe Annals of Applied Probability, 2001
- Stability and performance analysis of networks supporting elastic servicesIEEE/ACM Transactions on Networking, 2001
- Fair end-to-end window-based congestion controlIEEE/ACM Transactions on Networking, 2000
- On the transient behavior of the processor sharing queueQueueing Systems, 1994
- Processor-shared buffers with renegingPerformance Evaluation, 1994
- On queues with impatienceAdvances in Applied Probability, 1990