Age-Optimal Scheduling For Heterogeneous Traffic With Timely-Throughput Constraint
IEEE INFOCOM 2020 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS (INFOCOM WKSHPS)(2020)
摘要
For many time-critical Internet of Things applications, the performance depends heavily on the freshness of information. A fundamental problem in this scenario is how to support heterogeneous information traffic whose freshness may be measured by different metrics. This paper studies a single link wireless communication system where a sender supports two types of traffic status update and delay-constrained traffic. The sender decides whether to serve the delay-constrained traffic or sample an underlying status process and update the receiver (central controller) on the status. The optimal scheduling policy is designed to minimize the long-term average age of information (AoI) of the status at the central controller while guaranteeing minimum timely-throughput of the delay-constrained traffic. This problem is first formulated as a Constrained Markov Decision Process (GIMP) and then converted into unconstrained MDP by Lagrangian relaxation. The structural property of the optimal policy for the CMDP is derived and an optimal policy is developed. Moreover, considering the computation overhead of MDP, we develop a rather simple scheduling policy based on the Lyapunov-drift method. The performance is analyzed theoretically and verified by simulations.
更多查看译文
关键词
central controller,optimal scheduling policy,delay-constrained traffic,Constrained Markov Decision Process,optimal policy,simple scheduling policy,age-optimal scheduling,heterogeneous traffic,timely-throughput constraint,heterogeneous information traffic,single-link wireless communication system,status update,underlying status process,time-critical Internet of Things applications,Lyapunov-drift method,long-term average age of information
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络