Open Access
Translator Disclaimer
January 2003 Multiple-input heavy-traffic real-time queues
Lukasz Kruk, John Lehoczky, Steven Shreve, Shu-Ngai Yeung
Ann. Appl. Probab. 13(1): 54-99 (January 2003). DOI: 10.1214/aoap/1042765663

Abstract

A single queueing station that serves K input streams is considered. Each stream is an independent renewal process, with customers having random lead times. Customers are served by processor sharing across streams. Within each stream, two disciplines are considered--earliest deadline first and first-in, first-out. The set of current lead times of the K streams is modeled as a K-dimensional vector of random counting measures on $\mathbb{R}$, and the limit of this vector of measure-valued processes is obtained under heavy traffic conditions.

Citation

Download Citation

Lukasz Kruk. John Lehoczky. Steven Shreve. Shu-Ngai Yeung. "Multiple-input heavy-traffic real-time queues." Ann. Appl. Probab. 13 (1) 54 - 99, January 2003. https://doi.org/10.1214/aoap/1042765663

Information

Published: January 2003
First available in Project Euclid: 16 January 2003

zbMATH: 1046.60082
MathSciNet: MR1951994
Digital Object Identifier: 10.1214/aoap/1042765663

Subjects:
Primary: 60K25
Secondary: 60G57 , 60J65

Keywords: diffusion limits , Due dates , heavy traffic , Queueing , Random measures

Rights: Copyright © 2003 Institute of Mathematical Statistics

JOURNAL ARTICLE
46 PAGES


SHARE
Vol.13 • No. 1 • January 2003
Back to Top