信息新鲜度和系统性能权衡

Fatima Khattab Abu-Akleek, A. Alma'aitah
{"title":"信息新鲜度和系统性能权衡","authors":"Fatima Khattab Abu-Akleek, A. Alma'aitah","doi":"10.1109/ICICS52457.2021.9464535","DOIUrl":null,"url":null,"abstract":"In real time service’s applications that have to process user’s queries and information updates have a challenge in balancing the system performance and the information freshness where these properties are related by the response time and Age-of-Information (AOI) respectively. Such applications are fed with periodic incoming of updates and queries and have to decide to which process first. In this paper we are discussing this challenge and provide a simple algorithm for trading-off the response time and AOI. We first discuss the Query-k, Update-k and Joint(M,N) policies that already proposed in previous work then we introduce a simple algorithm for the Joint(M,N)-policy. The algorithm is working based on the output of Query-k and Update-k policies in addition to predefined threshold. Results presents the efficient balancing between response time and AOI.","PeriodicalId":421803,"journal":{"name":"2021 12th International Conference on Information and Communication Systems (ICICS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Information Freshness and System Performance Trading-off\",\"authors\":\"Fatima Khattab Abu-Akleek, A. Alma'aitah\",\"doi\":\"10.1109/ICICS52457.2021.9464535\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In real time service’s applications that have to process user’s queries and information updates have a challenge in balancing the system performance and the information freshness where these properties are related by the response time and Age-of-Information (AOI) respectively. Such applications are fed with periodic incoming of updates and queries and have to decide to which process first. In this paper we are discussing this challenge and provide a simple algorithm for trading-off the response time and AOI. We first discuss the Query-k, Update-k and Joint(M,N) policies that already proposed in previous work then we introduce a simple algorithm for the Joint(M,N)-policy. The algorithm is working based on the output of Query-k and Update-k policies in addition to predefined threshold. Results presents the efficient balancing between response time and AOI.\",\"PeriodicalId\":421803,\"journal\":{\"name\":\"2021 12th International Conference on Information and Communication Systems (ICICS)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-05-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 12th International Conference on Information and Communication Systems (ICICS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICICS52457.2021.9464535\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 12th International Conference on Information and Communication Systems (ICICS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICICS52457.2021.9464535","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在必须处理用户查询和信息更新的实时服务应用程序中,在平衡系统性能和信息新鲜度方面存在挑战,其中这些属性分别与响应时间和信息年龄(Age-of-Information, AOI)相关。这样的应用程序需要定期接收更新和查询,必须决定先处理哪个进程。在本文中,我们将讨论这一挑战,并提供一个简单的算法来权衡响应时间和AOI。本文首先讨论了前人提出的Query-k、Update-k和Joint(M,N)策略,然后介绍了Joint(M,N)策略的一种简单算法。除了预定义的阈值之外,该算法还基于Query-k和Update-k策略的输出进行工作。结果表明响应时间和AOI之间的平衡是有效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Information Freshness and System Performance Trading-off
In real time service’s applications that have to process user’s queries and information updates have a challenge in balancing the system performance and the information freshness where these properties are related by the response time and Age-of-Information (AOI) respectively. Such applications are fed with periodic incoming of updates and queries and have to decide to which process first. In this paper we are discussing this challenge and provide a simple algorithm for trading-off the response time and AOI. We first discuss the Query-k, Update-k and Joint(M,N) policies that already proposed in previous work then we introduce a simple algorithm for the Joint(M,N)-policy. The algorithm is working based on the output of Query-k and Update-k policies in addition to predefined threshold. Results presents the efficient balancing between response time and AOI.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
The influence of operating laser wavelengths on Doppler effect in LEO Optical satellite constellation Team YahyaD11 at the Mowjaz Multi-Topic Labelling Task SecKG: Leveraging attack detection and prediction using knowledge graphs DeSAN: De-anonymization against Background Knowledge in Social Networks Arabic Multi-Topic Labelling using Bidirectional Long Short-Term Memory
×
引用
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