Duffy, Ken R. and Malone, David (2008) Logarithmic asymptotics for a single-server processing distinguishable sources. Mathematical Methods of Operations Research , 68 (3). pp. 509-537. ISSN 1432-5217

Download (310kB)

Abstract

We consider a single-server first-in-first-out queue fed by a finite number of distinct sources of jobs. For a large class of short-range dependent and light-tailed distributed job processes, using functional large deviation techniques we prove a large deviation principle and logarithmic asymptotics for the joint waiting time and queue lengths distribution.We identify the paths that are most likely to lead to the rare events of large waiting times and long queue lengths. A number of examples are presented to illustrate salient features of the results.

Item Type:	Article
Additional Information:	The original publication is available at http://www.springerlink.com/content/d344k5267j521536/fulltext.pdf
Keywords:	Functional large deviations; Single server FIFO; Waiting time; Queue length.
Academic Unit:	Faculty of Science and Engineering > Research Institutes > Hamilton Institute Faculty of Science and Engineering > Mathematics and Statistics
Item ID:	1513
Identification Number:	https://doi.org/10.1007/s00186-007-0189-2
Depositing User:	Dr. David Malone
Date Deposited:	18 Aug 2009 14:49
Journal or Publication Title:	Mathematical Methods of Operations Research
Publisher:	Physica Verlag, An Imprint of Springer-Verlag GmbH
Refereed:	Yes
URI:	Publisher
Use Licence:	This item is available under a Creative Commons Attribution Non Commercial Share Alike Licence (CC BY-NC-SA). Details of this licence are available here

Repository Staff Only(login required)

Item control page

Downloads

Origin of downloads