Heavy traffic analysis for EDF queues with reneging (Q535200): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
Property / arXiv ID | |||
Property / arXiv ID: 1104.1047 / rank | |||
Normal rank |
Revision as of 16:01, 18 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Heavy traffic analysis for EDF queues with reneging |
scientific article |
Statements
Heavy traffic analysis for EDF queues with reneging (English)
0 references
11 May 2011
0 references
The paper considers a single-server queue in which customers have deadlines and are served until their deadlines elapse. The performance of the system is measured by the fraction of reneged work, defined as the residual work not serviced due to elapsed deadlines. This quantity is shown to be minimized by an earliest-deadline-first scheduling policy. The main result of the paper is a heavy traffic convergence theorem. It is shown that the limit of the scaled workload process is a doubly reflected Brownian motion with lower barrier zero and upper barrier at the mean of the lead time distribution. It is also shown that, conditional on the limiting workload, the resulting limiting measure-valued workload process is the same limiting process as when customers are served to completion.
0 references
due dates
0 references
heavy traffic
0 references
queueing
0 references
reneging
0 references
diffusion limits
0 references
random measures
0 references
real-time queues
0 references