Published June 16, 2021 | Version v1
Conference paper Open

No-Regret Slice Reservation Algorithms

  • 1. School of Computer Science and Statistics, Trinity College Dublin
  • 2. Delft University of Technology, Netherlands
  • 3. Department of Electrical and Computer Engineering, Virginia Tech, USA


Emerging network slicing markets promise to boost

the utilization of expensive network resources and to unleash

the potential of over-the-top services. Their success, however,

is conditioned on the service providers (SPs) being able to bid

effectively for the virtualized resources. In this paper we consider

a hybrid advance-reservation and spot slice market and study

how the SPs should reserve slices in order to maximize their

performance while not exceeding their budget. We consider this

problem in its general form, where the SP demand and slice

prices are time-varying and revealed only after the reservations

are decided. We develop a learning-based framework, using the

theory of online convex optimization, that allows the SP to employ

a no-regret reservation policy, i.e., achieve the same performance

with a hypothetical policy that has knowledge of future demand

and prices. We extend our framework for the scenario the SP

decides dynamically its slice orchestration, where it additionally

needs to learn which resource composition is performance -

maximizing; and we propose a mixed-time scale scheme that

allows the SP to leverage any spot-market information revealed

between its reservations. We evaluate our learning framework

and its extensions using a variety of simulation scenarios and

following a detailed parameter sensitivity analysis.


No regret slice reservation algorithms.pdf

Files (434.5 kB)

Name Size Download all
434.5 kB Preview Download

Additional details


DAEMON – Network intelligence for aDAptive and sElf-Learning MObile Networks 101017109
European Commission