We consider in this paper a dynamic resource allocation scheme between several Mobile Virtual Network Operators (MVNOs), sharing common radio resources at a Cloud-based Radio Access Network (C-RAN) run by a central operator. We specifically propose a two-level coupled auction so as to enhance resource utilization and maximize the revenues both for the central operator and the MVNOs: at the lower level, end users belonging to a given MVNO bid for resources and, at the higher-level, MVNOs compete for resources at the central operator based on the output of the lower-level auction. We show fundamental economic properties of our proposal: truthfulness and individual rationality, and propose a greedy algorithm to enhance its computational efficiency. We prove the existence of Nash equilibrium for the global auction and its uniqueness in a typical duopoly scenario. Further numerical results illustrate the performance of our proposal in various network settings.

(2018). A Two-level Auction for Resource Allocation in Multi-tenant C-RAN [journal article - articolo]. In COMPUTER NETWORKS. Retrieved from http://hdl.handle.net/10446/118688

A Two-level Auction for Resource Allocation in Multi-tenant C-RAN

Martignon, Fabio
2018-01-01

Abstract

We consider in this paper a dynamic resource allocation scheme between several Mobile Virtual Network Operators (MVNOs), sharing common radio resources at a Cloud-based Radio Access Network (C-RAN) run by a central operator. We specifically propose a two-level coupled auction so as to enhance resource utilization and maximize the revenues both for the central operator and the MVNOs: at the lower level, end users belonging to a given MVNO bid for resources and, at the higher-level, MVNOs compete for resources at the central operator based on the output of the lower-level auction. We show fundamental economic properties of our proposal: truthfulness and individual rationality, and propose a greedy algorithm to enhance its computational efficiency. We prove the existence of Nash equilibrium for the global auction and its uniqueness in a typical duopoly scenario. Further numerical results illustrate the performance of our proposal in various network settings.
articolo
2018
Morcos, Mira; Chahed, Tijani; Chen, Lin; Elias, Jocelyne; Martignon, Fabio
(2018). A Two-level Auction for Resource Allocation in Multi-tenant C-RAN [journal article - articolo]. In COMPUTER NETWORKS. Retrieved from http://hdl.handle.net/10446/118688
File allegato/i alla scheda:
File Dimensione del file Formato  
1-s2.0-S1389128618300707-main.pdf

Open Access dal 02/03/2020

Versione: postprint - versione referata/accettata senza referaggio
Licenza: Creative commons
Dimensione del file 1.34 MB
Formato Adobe PDF
1.34 MB Adobe PDF Visualizza/Apri
Pubblicazioni consigliate

Aisberg ©2008 Servizi bibliotecari, Università degli studi di Bergamo | Terms of use/Condizioni di utilizzo

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10446/118688
Citazioni
  • Scopus 7
  • ???jsp.display-item.citation.isi??? 7
social impact