Fluid limits for earliest-deadline-first networks

DOI10.1016/J.SPA.2022.12.006arXiv2009.07169MaRDI QIDQ6349166FDOQ6349166

Publication date: 15 September 2020

Abstract: This paper analyzes fluid scale asymptotics of two models of generalized Jackson networks employing the earliest deadline first (EDF) policy. One applies the 'soft' EDF policy, where deadlines are used to determine priority but jobs do not renege, and the other implements 'hard' EDF, where jobs renege when deadlines expire, and deadlines are postponed with each migration to a new station. The arrival rates, deadline distribution and service capacity are allowed to fluctuate over time at the fluid scale. Earlier work on EDF network fluid limits, used as a tool to obtain stability of these networks, addressed only the soft version of the policy, and moreover did not contain a full fluid limit result. In this paper, tools that extend the notion of the measure-valued Skorokhod map are developed and used to establish for the first time fluid limits for both the soft and hard EDF network models.

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Random measures (60G57)

This page was built for publication: Fluid limits for earliest-deadline-first networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6349166)