软更新的信息时代

Melih Bastopcu, S. Ulukus
{"title":"软更新的信息时代","authors":"Melih Bastopcu, S. Ulukus","doi":"10.1109/ALLERTON.2018.8635855","DOIUrl":null,"url":null,"abstract":"We consider an information updating system where an information provider and an information receiver engage in an update process over time. Different from the existing literature where updates are countable (hard) and take effect either immediately or after a delay, but instantaneously in both cases, here updates start taking effect right away but gradually over time. We coin this setting soft updates. When the updating process starts, the age decreases until the soft update period ends. We constrain the number of times the information provider and the information receiver meet (number of update periods) and the total duration of the update periods. We consider two models for the decrease of age during an update period: In the first model, the rate of decrease of the age is proportional to the current age, and in the second model, the rate of decrease of the age is constant. The first model results in an exponentially decaying age, and the second model results in a linearly decaying age. In both cases, we determine the optimum updating schemes, by determining the optimum start times and the optimum durations of the updates, subject to the constraints on the number of update periods (number of meetings) and the total update duration.","PeriodicalId":299280,"journal":{"name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"101 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"Age of Information with Soft Updates\",\"authors\":\"Melih Bastopcu, S. Ulukus\",\"doi\":\"10.1109/ALLERTON.2018.8635855\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider an information updating system where an information provider and an information receiver engage in an update process over time. Different from the existing literature where updates are countable (hard) and take effect either immediately or after a delay, but instantaneously in both cases, here updates start taking effect right away but gradually over time. We coin this setting soft updates. When the updating process starts, the age decreases until the soft update period ends. We constrain the number of times the information provider and the information receiver meet (number of update periods) and the total duration of the update periods. We consider two models for the decrease of age during an update period: In the first model, the rate of decrease of the age is proportional to the current age, and in the second model, the rate of decrease of the age is constant. The first model results in an exponentially decaying age, and the second model results in a linearly decaying age. In both cases, we determine the optimum updating schemes, by determining the optimum start times and the optimum durations of the updates, subject to the constraints on the number of update periods (number of meetings) and the total update duration.\",\"PeriodicalId\":299280,\"journal\":{\"name\":\"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)\",\"volume\":\"101 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ALLERTON.2018.8635855\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ALLERTON.2018.8635855","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

摘要

我们考虑一个信息更新系统,其中信息提供者和信息接收者随时间参与更新过程。现有的文献中,更新是可数的(很难),要么立即生效,要么延迟生效,但在这两种情况下,更新都是瞬间生效的,而在这里,更新会立即生效,但会随着时间的推移逐渐生效。我们将此设置为软更新。更新过程开始后,年龄逐渐减小,直到软更新周期结束。我们限制了信息提供者和信息接收者相遇的次数(更新周期的次数)和更新周期的总持续时间。我们考虑了更新周期内年龄下降的两个模型:第一个模型中,年龄下降的速度与当前年龄成正比,第二个模型中,年龄下降的速度是恒定的。第一个模型的结果是指数衰减的年龄,第二个模型的结果是线性衰减的年龄。在这两种情况下,我们通过确定更新的最佳开始时间和最佳持续时间来确定最佳更新方案,并受更新周期(会议次数)和总更新持续时间的约束。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Age of Information with Soft Updates
We consider an information updating system where an information provider and an information receiver engage in an update process over time. Different from the existing literature where updates are countable (hard) and take effect either immediately or after a delay, but instantaneously in both cases, here updates start taking effect right away but gradually over time. We coin this setting soft updates. When the updating process starts, the age decreases until the soft update period ends. We constrain the number of times the information provider and the information receiver meet (number of update periods) and the total duration of the update periods. We consider two models for the decrease of age during an update period: In the first model, the rate of decrease of the age is proportional to the current age, and in the second model, the rate of decrease of the age is constant. The first model results in an exponentially decaying age, and the second model results in a linearly decaying age. In both cases, we determine the optimum updating schemes, by determining the optimum start times and the optimum durations of the updates, subject to the constraints on the number of update periods (number of meetings) and the total update duration.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信