Sequential Resource Access: Theory and Algorithm - Archive ouverte HAL Access content directly
Conference Papers Year :

Sequential Resource Access: Theory and Algorithm

Lin Chen
Wei Wang
  • Function : Author
  • PersonId : 1084678
Lin Shan
  • Function : Author
  • PersonId : 1084679


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 (epsilon,delta)-optimality, with the key component being a pruning process eliminating dominated strategies and, thus maintaining polynomial time and space overhead.
Fichier principal
Vignette du fichier
resource_access (1).pdf (305.78 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03043691 , version 1 (23-12-2020)



Lin Chen, Anastasios Giovanidis, Wei Wang, Lin Shan. Sequential Resource Access: Theory and Algorithm. IEEE International Conference on Computer Communications (INFOCOM 2021), May 2021, Vancouver (virtual), Canada. ⟨hal-03043691⟩
79 View
43 Download



Gmail Facebook Twitter LinkedIn More