Quality of Information aware scheduling in task processing networks

Rahul Urgaonkar, E. Ciftcioglu, A. Yener, M. Neely
{"title":"Quality of Information aware scheduling in task processing networks","authors":"Rahul Urgaonkar, E. Ciftcioglu, A. Yener, M. Neely","doi":"10.1109/WIOPT.2011.5930052","DOIUrl":null,"url":null,"abstract":"We investigate Quality of Information (QoI) aware scheduling in task processing networks. Specifically, we consider the scenario where a network sequentially receives tasks from an end user, utilizes its resources to process them, and sends back its response. The utility derived by the end user from this response depends on both the accuracy and the freshness of the information. There is often a trade-off between these two attributes and we present a model that quantifies this dependence. Using dynamic programming and optimal stopping theory, we characterize the optimal scheduling policy that maximizes the time average utility delivered by the network. We show that for many scenarios of practical interest, the optimal policy has a simple threshold structure. We also propose a method to approximately compute the threshold in closed-form. This work takes a step towards incorporating application aware objectives in making optimal scheduling decisions.","PeriodicalId":430755,"journal":{"name":"2011 International Symposium of Modeling and Optimization of Mobile, Ad Hoc, and Wireless Networks","volume":"46 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Symposium of Modeling and Optimization of Mobile, Ad Hoc, and Wireless Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WIOPT.2011.5930052","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

Abstract

We investigate Quality of Information (QoI) aware scheduling in task processing networks. Specifically, we consider the scenario where a network sequentially receives tasks from an end user, utilizes its resources to process them, and sends back its response. The utility derived by the end user from this response depends on both the accuracy and the freshness of the information. There is often a trade-off between these two attributes and we present a model that quantifies this dependence. Using dynamic programming and optimal stopping theory, we characterize the optimal scheduling policy that maximizes the time average utility delivered by the network. We show that for many scenarios of practical interest, the optimal policy has a simple threshold structure. We also propose a method to approximately compute the threshold in closed-form. This work takes a step towards incorporating application aware objectives in making optimal scheduling decisions.
任务处理网络中信息感知调度的质量
研究了任务处理网络中信息质量感知调度问题。具体地说,我们考虑这样一个场景:网络依次从终端用户接收任务,利用其资源处理它们,然后发回响应。最终用户从该响应中获得的效用取决于信息的准确性和新鲜度。这两种属性之间经常存在权衡,我们提出了一个量化这种依赖关系的模型。利用动态规划和最优停止理论,刻画了网络时间平均效用最大化的最优调度策略。我们表明,对于许多实际情况,最优策略具有简单的阈值结构。我们还提出了一种近似计算闭式阈值的方法。这项工作朝着在制定最佳调度决策时纳入应用程序感知目标迈出了一步。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信