2020/12/07 by Chen, Lin, Anastasios Giovanidis, Giovanidis, Anastasios +3
Computer Science · #Age of Information Optimization #FOS: Computer and information sciences #IoT and Edge/Fog Computing #Networking and Internet Architecture (cs.NI) #Real-Time Systems Scheduling
paper · doi:10.48550/arxiv.2012.03734
openalex publication_date 2020/12/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29
We formulate and analyze a generic sequential resource access problem arising in a variety of engineering fields, where a user disposes a number of heterogeneous computing, communication, or storage resources, each characterized by the probability of successfully executing the user's task and the related access delay and cost, and seeks an optimal access strategy to maximize her utility within a given time horizon, defined as the expected reward minus the access cost. We develop an algorithmic framework on the (near-)optimal sequential resource access strategy. We first prove that the problem of finding an optimal strategy is NP-hard in general. Given the hardness result, we present a greedy strategy implementable in linear time, and establish the closed-form sufficient condition for its optimality. We then develop a series of polynomial-time approximation algorithms achieving (ε,δ)-optimality, with the key component being a pruning process eliminating dominated strategies and, thus maintaining polynomial time and space overhead.