Fluid limits for earliest-deadline-first networks

TL;DR

This paper establishes fluid limit results for both soft and hard earliest deadline first (EDF) networks, extending previous work by developing new measure-valued Skorokhod map tools to analyze their asymptotic behavior.

Contribution

It provides the first comprehensive fluid limit analysis for both soft and hard EDF network models, including cases with fluctuating parameters.

Findings

Fluid limits are established for soft EDF networks.

Fluid limits are established for hard EDF networks.

New measure-valued Skorokhod map tools are developed.

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.