Stability of Earliest-Due-Date, First-Served Queueing Networks

Authors:
Maury Bramson
Affiliations:
School of Mathematics, University of Minnesota, Minneapolis, MN 55455, USA
Venue:
Queueing Systems: Theory and Applications
Year:
2001

Citing 5
Cited 2

Stability and instability of fluid models for reentrant lines

Mathematics of Operations Research
Stability of two families of queueing networks and a discussion of fluid limits

Queueing Systems: Theory and Applications
Diffusion approximations for open multiclass queueing networks: sufficient conditions involving state space collapse

Queueing Systems: Theory and Applications
State space collapse with application to heavy traffic limits for multiclass queueing networks

Queueing Systems: Theory and Applications
Universal stability results for greedy contention-resolution protocols

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science

An Open Queueing Network with Asymptotically Stable Fluid Model and Unconventional Heavy Traffic Behavior

Mathematics of Operations Research
Stability analysis of N-model systems under a static priority rule

Queueing Systems: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

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 ρjj.