When to Preempt? Age of Information Minimization under Link Capacity Constraint.

Journal of Communications and Networks(2019)

引用 31|浏览25
暂无评分
摘要
In this paper, we consider a scenario where a source continuously monitors an object and sends time-stamped status updates to a destination through a rate-limited link. We assume updates arrive randomly at the source according to a Bernoulli process. Due to the link capacity constraint, it takes multiple time slots for the source to complete the transmission of an update. Therefore, when a new upd...
更多
查看译文
关键词
Switches,Information age,Minimization,Monitoring,Markov processes,Servers,Energy harvesting
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要