论文标题
最早的deadline优先网络的流体限制
Fluid limits for earliest-deadline-first networks
论文作者
论文摘要
本文分析了采用最早的截止日期（EDF）策略的两种通用杰克逊网络模型的流体量表。一个人应用“软” EDF政策，该政策使用截止日期来确定优先级，但工作不会撤消，而另一个则实施了“硬” EDF，在截止日期到期时的工作不断变化，并且在每个迁移到新站的迁移时都会推迟期限。随着时间的推移，到达率，截止日期分布和服务能力可以随着流体量表而波动。 EDF网络流体限制的早期工作，用作获得这些网络稳定性的工具，仅解决了策略的软版本，此外，不包含完整的流体限制结果。在本文中，开发并使用了扩展量度值Skorokhod映射概念的工具，并用于为软性EDF网络模型首次建立流体限制。
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.
