Online Optimization for Randomized Network Resource Allocation with Long-Term Constraints

arXiv:2305.15558v2 Announce Type: replace-cross
Abstract: In this paper, we study an optimal online resource reservation problem in a simple communication network. The network is composed of two compute nodes linked by a local communication link. The system operates in discrete time; at each time slot, the administrator reserves resources for servers before the actual job requests are known. A cost is incurred for the reservations made. Then, after the client requests are observed, jobs may be transferred from one server …

abstract arxiv communication compute constraints cs.lg long-term math.oc network nodes optimization paper resources simple stat.ml study type