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
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