当前位置:
X-MOL 学术
›
arXiv.cs.PF
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Deadline-aware Scheduling for Maximizing Information Freshness in Industrial Cyber-Physical System
arXiv - CS - Performance Pub Date : 2019-12-24 , DOI: arxiv-1912.11310 Devarpita Sinha and Rajarshi Roy
arXiv - CS - Performance Pub Date : 2019-12-24 , DOI: arxiv-1912.11310 Devarpita Sinha and Rajarshi Roy
Age of Information is an interesting metric that captures the freshness of
information in the underlying applications. It is a combination of both packets
inter-arrival time and packet transmission delay. In recent times, advanced
real-time systems rely on this metric for delivering status updates as timely
as possible. This paper aims to accomplish optimal transmission scheduling
policy to maintain the information freshness of real-time updates in the
industrial cyber-physical systems. Here the coexistence of both cyber and
physical units and their individual requirements to provide the quality of
service is one of the critical challenges to handle. A greedy scheduling policy
called deadline-aware highest latency first has been proposed for this purpose.
This paper also gives the analytical proof of its optimality, and finally, the
claim is validated by comparing the performance of our algorithm with other
scheduling policies by extensive simulations.
中文翻译:
用于最大化工业信息物理系统中信息新鲜度的截止时间感知调度
信息时代是一个有趣的指标,它捕捉底层应用程序中信息的新鲜度。它是数据包到达间隔时间和数据包传输延迟的组合。最近,先进的实时系统依靠这个指标来尽可能及时地提供状态更新。本文旨在实现最优传输调度策略,以保持工业信息物理系统中实时更新的信息新鲜度。在这里,网络和物理单元的共存及其提供服务质量的个性化要求是需要处理的关键挑战之一。为此,首先提出了一种称为截止时间感知最高延迟的贪婪调度策略。本文还给出了其最优性的分析证明,最后,
更新日期:2020-09-29
中文翻译:
用于最大化工业信息物理系统中信息新鲜度的截止时间感知调度
信息时代是一个有趣的指标,它捕捉底层应用程序中信息的新鲜度。它是数据包到达间隔时间和数据包传输延迟的组合。最近,先进的实时系统依靠这个指标来尽可能及时地提供状态更新。本文旨在实现最优传输调度策略,以保持工业信息物理系统中实时更新的信息新鲜度。在这里,网络和物理单元的共存及其提供服务质量的个性化要求是需要处理的关键挑战之一。为此,首先提出了一种称为截止时间感知最高延迟的贪婪调度策略。本文还给出了其最优性的分析证明,最后,