Exponentially Weighted Algorithm for Online Network Resource Allocation with Long-Term Constraints

arXiv:2405.02373v1 Announce Type: cross
Abstract: This paper studies an online optimal resource reservation problem in communication networks with job transfers where the goal is to minimize the reservation cost while maintaining the blocking cost under a certain budget limit. To tackle this problem, we propose a novel algorithm based on a randomized exponentially weighted method that encompasses long-term constraints. We then analyze the performance of our algorithm by establishing an upper bound for the associated regret and the cumulative constraint …

abstract algorithm arxiv blocking budget communication constraints cost cs.lg job long-term math.oc network networks novel paper stat.ml studies type while