包括信息时代在内的陈旧信息指标的最佳更新时间

Chris Ferguson;Leonard Kleinrock
{"title":"包括信息时代在内的陈旧信息指标的最佳更新时间","authors":"Chris Ferguson;Leonard Kleinrock","doi":"10.1109/JSAIT.2023.3344760","DOIUrl":null,"url":null,"abstract":"In this paper we examine the general problem of determining when to update information that can go out-of-date. Not updating frequently enough results in poor decision making based on stale information. Updating too often results in excessive update costs. We study the tradeoff between having stale information and the cost of updating that information. We use a general model, some versions of which match an idealized version of the Age of Information (AoI) model. We first present the assumptions, and a novel methodology for solving problems of this sort. Then we solve the case where the update cost is fixed and the time-value of the information is well understood. Our results provide simple and powerful insights regarding optimal update times. We further look at cases where there are delays associated with sending a request for an update and receiving the update, cases where the update source may be stale, cases where the information cannot be used during the update process, and cases where update costs can change randomly.","PeriodicalId":73295,"journal":{"name":"IEEE journal on selected areas in information theory","volume":"4 ","pages":"734-746"},"PeriodicalIF":0.0000,"publicationDate":"2023-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10371395","citationCount":"0","resultStr":"{\"title\":\"Optimal Update Times for Stale Information Metrics Including the Age of Information\",\"authors\":\"Chris Ferguson;Leonard Kleinrock\",\"doi\":\"10.1109/JSAIT.2023.3344760\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we examine the general problem of determining when to update information that can go out-of-date. Not updating frequently enough results in poor decision making based on stale information. Updating too often results in excessive update costs. We study the tradeoff between having stale information and the cost of updating that information. We use a general model, some versions of which match an idealized version of the Age of Information (AoI) model. We first present the assumptions, and a novel methodology for solving problems of this sort. Then we solve the case where the update cost is fixed and the time-value of the information is well understood. Our results provide simple and powerful insights regarding optimal update times. We further look at cases where there are delays associated with sending a request for an update and receiving the update, cases where the update source may be stale, cases where the information cannot be used during the update process, and cases where update costs can change randomly.\",\"PeriodicalId\":73295,\"journal\":{\"name\":\"IEEE journal on selected areas in information theory\",\"volume\":\"4 \",\"pages\":\"734-746\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-12-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10371395\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE journal on selected areas in information theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10371395/\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE journal on selected areas in information theory","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10371395/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在本文中,我们研究了确定何时更新可能过时信息的一般问题。更新不够频繁会导致基于过时信息的决策失误。更新过于频繁则会导致过高的更新成本。我们研究了陈旧信息与更新该信息的成本之间的权衡问题。我们使用了一个通用模型,其中某些版本与理想化版本的信息时代(AoI)模型相匹配。我们首先介绍了假设条件,以及解决此类问题的新方法。然后,我们解决了更新成本固定且信息的时间价值明确的情况。我们的结果为最佳更新时间提供了简单而有力的启示。我们还进一步研究了与发送更新请求和接收更新相关的延迟情况、更新源可能过时的情况、更新过程中无法使用信息的情况以及更新成本可能随机变化的情况。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Optimal Update Times for Stale Information Metrics Including the Age of Information
In this paper we examine the general problem of determining when to update information that can go out-of-date. Not updating frequently enough results in poor decision making based on stale information. Updating too often results in excessive update costs. We study the tradeoff between having stale information and the cost of updating that information. We use a general model, some versions of which match an idealized version of the Age of Information (AoI) model. We first present the assumptions, and a novel methodology for solving problems of this sort. Then we solve the case where the update cost is fixed and the time-value of the information is well understood. Our results provide simple and powerful insights regarding optimal update times. We further look at cases where there are delays associated with sending a request for an update and receiving the update, cases where the update source may be stale, cases where the information cannot be used during the update process, and cases where update costs can change randomly.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
8.20
自引率
0.00%
发文量
0
期刊最新文献
Source Coding for Markov Sources With Partial Memoryless Side Information at the Decoder Deviation From Maximal Entanglement for Mid-Spectrum Eigenstates of Local Hamiltonians Statistical Inference With Limited Memory: A Survey Tightening Continuity Bounds for Entropies and Bounds on Quantum Capacities Dynamic Group Testing to Control and Monitor Disease Progression in a Population
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1