Open Access
Translator Disclaimer
2013 Fluid limits for overloaded multiclass FIFO single-server queues with general abandonment
Otis B. Jennings, Amber L. Puha
Stoch. Syst. 3(1): 262-321 (2013). DOI: 10.1214/12-SSY085

Abstract

We consider an overloaded multiclass nonidling first-in-first-out single-server queue with abandonment. The interarrival times, service times, and deadline times are sequences of independent and identically, but generally distributed random variables. In prior work, Jennings and Reed studied the workload process associated with this queue. Under mild conditions, they establish both a functional law of large numbers and a functional central limit theorem for this process. We build on that work here. For this, we consider a more detailed description of the system state given by $K$ finite, nonnegative Borel measures on the nonnegative quadrant, one for each job class. For each time and job class, the associated measure has a unit atom associated with each job of that class in the system at the coordinates determined by what are referred to as the residual virtual sojourn time and residual patience time of that job. Under mild conditions, we prove a functional law of large numbers for this measure-valued state descriptor. This yields approximations for related processes such as the queue lengths and abandoning queue lengths. An interesting characteristic of these approximations is that they depend on the deadline distributions in their entirety.

Citation

Download Citation

Otis B. Jennings. Amber L. Puha. "Fluid limits for overloaded multiclass FIFO single-server queues with general abandonment." Stoch. Syst. 3 (1) 262 - 321, 2013. https://doi.org/10.1214/12-SSY085

Information

Published: 2013
First available in Project Euclid: 24 February 2014

zbMATH: 1296.60244
MathSciNet: MR3353473
Digital Object Identifier: 10.1214/12-SSY085

Subjects:
Primary: 60B12, 60F17, 60K25
Secondary: 68M20, 90B22

Rights: Copyright © 2013 INFORMS Applied Probability Society

JOURNAL ARTICLE
60 PAGES


SHARE
Vol.3 • No. 1 • 2013
Back to Top