DeepAI AI Chat
Log In Sign Up

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

by   Ahmed Sid-Ali, et al.
Carleton University

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 to the other to best accommodate the demands by incurring an additional transport cost. If certain job requests cannot be satisfied, there is a violation that engenders a cost to pay for each of the blocked jobs. The goal is to minimize the overall reservation cost over finite horizons while maintaining the cumulative violation and transport costs under a certain budget limit. To study this problem, we first formalize it as a repeated game against nature where the reservations are drawn randomly according to a sequence of probability distributions that are derived from an online optimization problem over the space of allowable reservations. We then propose an online saddle-point algorithm for which we present an upper bound for the associated K-benchmark regret together with an upper bound for the cumulative constraint violations. Finally, we present numerical experiments where we compare the performance of our algorithm with those of simple deterministic resource allocation policies.


Dynamic Vector Bin Packing for Online Resource Allocation in the Cloud

Several cloud-based applications, such as cloud gaming, rent servers to ...

An online joint replenishment problem combined with single machine scheduling

This paper considers a combination of the joint replenishment problem wi...

Learning to Schedule

This paper proposes a learning and scheduling algorithm to minimize the ...

heSRPT: Parallel Scheduling to Minimize Mean Slowdown

Modern data centers serve workloads which are capable of exploiting para...

The Preemptive Resource Allocation Problem

We revisit a classical scheduling model to incorporate modern trends in ...

Regret Analysis of the Stochastic Direct Search Method for Blind Resource Allocation

Motivated by programmatic advertising optimization, we consider the task...

Nara: Learning Network-Aware Resource Allocation Algorithms for Cloud Data Centres

Data centres (DCs) underline many prominent future technological trends ...