TY - GEN
T1 - Quality of Information aware scheduling in task processing networks
AU - Urgaonkar, Rahul
AU - Ciftcioglu, Ertugrul Necdet
AU - Yener, Aylin
AU - Neely, Michael J.
N1 - Copyright:
Copyright 2011 Elsevier B.V., All rights reserved.
PY - 2011
Y1 - 2011
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=79960571529&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79960571529&partnerID=8YFLogxK
U2 - 10.1109/WIOPT.2011.5930052
DO - 10.1109/WIOPT.2011.5930052
M3 - Conference contribution
AN - SCOPUS:79960571529
SN - 9781612848242
T3 - 2011 International Symposium on Modeling and Optimization of Mobile, Ad Hoc, and Wireless Networks, WiOpt 2011
SP - 401
EP - 406
BT - 2011 International Symposium on Modeling and Optimization of Mobile, Ad Hoc, and Wireless Networks, WiOpt 2011
T2 - 2011 International Symposium of on Modeling and Optimization of Mobile, Ad Hoc, and Wireless Networks, WiOpt 2011
Y2 - 9 May 2011 through 13 May 2011
ER -