Abstract
We study multiclass queueing networks with the earliest-due-date, first-served (EDDFS) discipline. For these networks, the service priority of a customer is determined, upon its arrival in the network, by an assigned random due date. First-in-system, first-out queueing networks, where a customer's priority is given by its arrival time in the network, are a special case. Using fluid models, we show that EDDFS queueing networks, without preemption, are stable whenever the traffic intensity satisfies ρ j < 1 for each station j.
Original language | English (US) |
---|---|
Pages (from-to) | 79-102 |
Number of pages | 24 |
Journal | Queueing Systems |
Volume | 39 |
Issue number | 1 |
DOIs | |
State | Published - Sep 2001 |
Bibliographical note
Funding Information:∗Partially supported by NSF Grant DMS-9971248.
Keywords
- Fluid models
- Queueing networks
- Stability