Stability of earliest-due-date, first-served queueing networks

Maury Bramson

Research output: Contribution to journalArticlepeer-review

16 Scopus citations

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 languageEnglish (US)
Pages (from-to)79-102
Number of pages24
JournalQueueing Systems
Volume39
Issue number1
DOIs
StatePublished - Sep 2001

Bibliographical note

Funding Information:
∗Partially supported by NSF Grant DMS-9971248.

Keywords

  • Fluid models
  • Queueing networks
  • Stability

Fingerprint Dive into the research topics of 'Stability of earliest-due-date, first-served queueing networks'. Together they form a unique fingerprint.

Cite this