A two-level auction for resource allocation in multi-tenant C-RAN

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
Type de document :
Article dans une revue
Computer Networks, Elsevier, 2018, pp.240-252. 〈10.1016/j.comnet.2018.02.005〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01701702
Contributeur : Fabio Martignon <>
Soumis le : mardi 6 février 2018 - 09:15:49
Dernière modification le : lundi 11 juin 2018 - 14:09:02

Identifiants

Citation

Morcos Mira, Tijani Chahed, Lin Chen, Jocelyne Elias, Fabio Martignon. A two-level auction for resource allocation in multi-tenant C-RAN. Computer Networks, Elsevier, 2018, pp.240-252. 〈10.1016/j.comnet.2018.02.005〉. 〈hal-01701702〉

Partager

Métriques

Consultations de la notice

233