Titre :

Strategic Resource Pricing and Allocation in a 5G Network Slicing Stackelberg Game

Auteur(s) :

Datar, Mandar [Auteur]
Network Engineering and Operations [NEO]
Laboratoire Informatique d'Avignon [LIA]
Altman, Eitan [Auteur]
Laboratory of Information, Network and Communication Sciences [LINCS]
Network Engineering and Operations [NEO]
Laboratoire Informatique d'Avignon [LIA]
Le Cadre, Hélène [Auteur]
Integrated Optimization with Complex Structure [INOCS]

Titre de la revue :

IEEE Transactions on Network and Service Management

Pagination :

1932--4537

Éditeur :

IEEE

Date de publication :

2023

ISSN :

1932-4537

Mot(s)-clé(s) en anglais :

Communication service market
Game theory
Trading post mechanism
Pricing
5G network slicing
Resource allocation

Discipline(s) HAL :

Mathématiques [math]/Optimisation et contrôle [math.OC]
Informatique [cs]/Intelligence artificielle [cs.AI]

Résumé en anglais : [en]

We consider a marketplace in the context of 5G network slicing, where Application Service Providers (ASP), i.e., slice tenants, providing heterogeneous services, are in competition for the access to the virtualized network ...
Lire la suite >We consider a marketplace in the context of 5G network slicing, where Application Service Providers (ASP), i.e., slice tenants, providing heterogeneous services, are in competition for the access to the virtualized network resource owned by a Network Slice Provider (NSP), who relies on network slicing. We model the interactions between the end users (followers) and the ASPs (leaders) as a Stackelberg game. We prove that the competition between the ASPs results in a multi-resource Tullock rent-seeking game. To determine resource pricing and allocation, we devise two innovative market mechanisms. First, we assume that the ASPs are pre-assigned with fixed shares (budgets) of infrastructure, and rely on a trading post mechanism to allocate the resource. Under this mechanism, the ASPs can redistribute their budgets in bids and customise their allocations to maximize their profits. In case a single resource is considered, we prove that the ASPs' coupled decision problems give rise to a unique Nash equilibrium. Second, when ASPs have no bound on their budget, we formulate the problem as a pricing game with coupling constraints capturing the shared resource finite capacities, and derive the market prices as the duals of the coupling constraints. In addition, we prove that the pricing game admits a unique variational equilibrium. We implement two online learning algorithms to compute solutions of the market mechanisms. A third fully distributed algorithm based on a proximal method is proposed to compute the Variational equilibrium solution of the pricing game. Finally, we run numerical simulations to analyse the market mechanism's economic properties and the convergence rates of the algorithms.Lire moins >

Langue :

Anglais

Vulgarisation :

Non

Collections :

• Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189

Source :

Harvested from HAL