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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. Andrews, B. Awerbuch, A. Fernandez, J. Kleinberg, T. Leighton and Z. Lin, Universal stability results for greedy contention–resolution protocols, in: Proc. of the 37th Annual Symposium on Foundations of Computer Science (IEEE Computer. Soc. Press., Los Alamitos, CA, 1996) pp. 380–389.
M. Bramson, Instability of FIFO queueing networks, Ann. Appl. Probab. 4 (1994) 414–431.
M. Bramson, Convergence to equilibria for fluid models of FIFO queueing networks, Queueing Systems 22 (1996) 5–45.
M. Bramson, Convergence to equilibria for fluid models of head–of–the–line proportional processor sharing networks, Queueing Systems 23 (1996) 1–26.
M. Bramson, Stability of two families of queueing networks and a discussion of fluid limits, Queueing Systems 28 (1998) 7–31.
M. Bramson, State space collapse with application to heavy traffic limits for multiclass queueing networks, Queueing Systems 30 (1998) 89–148.
M. Bramson and J. Dai, Heavy traffic limits for some queueing networks, Ann. Appl. Probab. 11 (2001) 49–90.
J. Dai, On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models, Ann. Appl. Probab. 5 (1995) 49–77.
J. Dai and G. Weiss, Stability and instability of fluid models for re–entrant lines, Math. Oper. Res. 21 (1996) 115–134.
B. Doytchinov, J. Lehoczky and S. Shreve, Real–time queues in heavy traffic with earliest–deadline–first queue discipline, to appear in Appl. Probab.
J.M. Harrison, Brownian models of queueing networks with heterogeneous customer populations, in: Stochastic Differential Systems, Stochastic Control Theory and their Applications, The IMA Volumes in Mathematics and its Applications, Vol. 10 (Springer, New York, 1988) pp. 1–20.
W. Hopp and M. Spearman, Factory Physics: Foundations of Manufacturing Management (Irwin, Chicago, 1996).
F.P. Kelly, Reversibility and Stochastic Networks (Wiley, New York, 1979).
S.H. Lu and P.R. Kumar, Distributed scheduling based on due dates and buffer priorities, IEEE Trans. Automat. Control 36 (1991) 1406–1416.
S. Meyn and R.L. Tweedie, Stability of Markovian processes III: Foster–Lyapunov criteria for continuous time processes, Adv. in Appl. Probab. 25 (1993) 518–548.
S. Meyn and R.L. Tweedie, State–dependent criteria for convergence of Markov chains, Ann. Appl. Probab. 4 (1994) 149–168.
S. Rybko and A. Stolyar, Ergodicity of stochastic processes that describe the functioning of open queueing networks, Problems Inform. Transmission 28 (1992) 3–26 (in Russian).
T.I. Seidman, “First come, first served” can be unstable!, IEEE Trans. Automat. Control 39 (1994) 2166–2171.
[19] A. Stolyar, On the stability of multiclass queueing networks, in: Proc. of the 2nd Conf. on Telecommunication Systems–Modeling and Analysis, Nashville, 1994, pp. 1020–1028.
P. Tsaparas, Stability in generalized adversarial queueing theory, to appear in IEEE Trans. Automat. Control.
R.J. Williams, Diffusion approximations for open multiclass queueing networks: sufficient conditions involving state space collapse, Queueing Systems 30 (1998) 27–88.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bramson, M. Stability of Earliest-Due-Date, First-Served Queueing Networks. Queueing Systems 39, 79–102 (2001). https://doi.org/10.1023/A:1017987600517
Issue Date:
DOI: https://doi.org/10.1023/A:1017987600517