Answers are grounded in this paper and cite their sources.
We consider multiserver queues in which a customer is lost whenever its waiting time is larger than its (possibly random) deadline. For such systems, the number of (successful) departures and the number of customers lost over a time interval are the performance measures of interest. We show that these quantities are (stochastically) monotone functions of the arrival, service and deadline processes.
No takes yet. Share an insight, caveat, or question.
Bhattacharya et al. (1991) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: