A Combinatorial Auction for Joint Radio and Processing Resource Allocation in C-RAN

Mira Morcos; Jocelyne Elias; Fabio Martignon; Lin Chen; Tijani Chahed

doi:10.1109/ICC.2019.8762077

A Combinatorial Auction for Joint Radio and Processing Resource Allocation in C-RAN

Mira Morcos
, Jocelyne Elias
, Fabio Martignon
, Lin Chen
, Tijani Chahed

Université de Paris

Résultats de recherche: Le chapitre dans un livre, un rapport, une anthologie ou une collection › Contribution à une conférence › Revue par des pairs

Résumé

In this paper, we propose a truthful combinatorial auction for the joint radio and processing resource allocation problem in the context of a Cloud-based Radio Access Network (C-RAN). We formulate the auction as an Integer Linear Program (ILP), taking into accurate account interference constraints while leveraging radio resource reuse to generate an optimal revenue for the RAN operator. Then, we propose Truthful Greedy Approach (TGA), an effective and truthful heuristic that guarantees a close-to-optimum revenue compared to the one obtained with the ILP formulation. Extensive simulations, conducted in representative network scenarios, compare and evaluate our auction with state-of-the-art approaches from the literature, showing its effectiveness.

langue originale	Anglais
titre	2019 IEEE International Conference on Communications, ICC 2019 - Proceedings
Editeur	Institute of Electrical and Electronics Engineers Inc.
ISBN (Electronique)	9781538680889
Les DOIs	https://doi.org/10.1109/ICC.2019.8762077
état	Publié - 1 mai 2019
Modification externe	Oui
Evénement	2019 IEEE International Conference on Communications, ICC 2019 - Shanghai, Chine Durée: 20 mai 2019 → 24 mai 2019

Série de publications

Nom	IEEE International Conference on Communications
Volume	2019-May
ISSN (imprimé)	1550-3607

Une conférence

Une conférence	2019 IEEE International Conference on Communications, ICC 2019
Pays/Territoire	Chine
La ville	Shanghai
période	20/05/19 → 24/05/19

SDG des Nations Unies

Ce résultat contribue à ou aux Objectifs de développement durable suivants

SDG 12 Consommation et production responsables

Accès au document

10.1109/ICC.2019.8762077

Contient cette citation

Morcos, M., Elias, J., Martignon, F., Chen, L., & Chahed, T. (2019). A Combinatorial Auction for Joint Radio and Processing Resource Allocation in C-RAN. Dans 2019 IEEE International Conference on Communications, ICC 2019 - Proceedings Article 8762077 (IEEE International Conference on Communications; Vol 2019-May). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICC.2019.8762077

@inproceedings{5b8cce81b3894849b39fd23fddba3185,

title = "A Combinatorial Auction for Joint Radio and Processing Resource Allocation in C-RAN",

abstract = "In this paper, we propose a truthful combinatorial auction for the joint radio and processing resource allocation problem in the context of a Cloud-based Radio Access Network (C-RAN). We formulate the auction as an Integer Linear Program (ILP), taking into accurate account interference constraints while leveraging radio resource reuse to generate an optimal revenue for the RAN operator. Then, we propose Truthful Greedy Approach (TGA), an effective and truthful heuristic that guarantees a close-to-optimum revenue compared to the one obtained with the ILP formulation. Extensive simulations, conducted in representative network scenarios, compare and evaluate our auction with state-of-the-art approaches from the literature, showing its effectiveness.",

keywords = "C-RAN, Combinatorial auction, Multi-resource allocation, Truthfulness",

author = "Mira Morcos and Jocelyne Elias and Fabio Martignon and Lin Chen and Tijani Chahed",

note = "Publisher Copyright: {\textcopyright} 2019 IEEE.; 2019 IEEE International Conference on Communications, ICC 2019 ; Conference date: 20-05-2019 Through 24-05-2019",

year = "2019",

month = may,

day = "1",

doi = "10.1109/ICC.2019.8762077",

language = "English",

series = "IEEE International Conference on Communications",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

booktitle = "2019 IEEE International Conference on Communications, ICC 2019 - Proceedings",

}

Morcos, M, Elias, J, Martignon, F, Chen, L & Chahed, T 2019, A Combinatorial Auction for Joint Radio and Processing Resource Allocation in C-RAN. Dans 2019 IEEE International Conference on Communications, ICC 2019 - Proceedings., 8762077, IEEE International Conference on Communications, VOL. 2019-May, Institute of Electrical and Electronics Engineers Inc., 2019 IEEE International Conference on Communications, ICC 2019, Shanghai, Chine, 20/05/19. https://doi.org/10.1109/ICC.2019.8762077

A Combinatorial Auction for Joint Radio and Processing Resource Allocation in C-RAN. / Morcos, Mira; Elias, Jocelyne; Martignon, Fabio et al.
2019 IEEE International Conference on Communications, ICC 2019 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2019. 8762077 (IEEE International Conference on Communications; Vol 2019-May).

Résultats de recherche: Le chapitre dans un livre, un rapport, une anthologie ou une collection › Contribution à une conférence › Revue par des pairs

TY - GEN

T1 - A Combinatorial Auction for Joint Radio and Processing Resource Allocation in C-RAN

AU - Morcos, Mira

AU - Elias, Jocelyne

AU - Martignon, Fabio

AU - Chen, Lin

AU - Chahed, Tijani

PY - 2019/5/1

Y1 - 2019/5/1

N2 - In this paper, we propose a truthful combinatorial auction for the joint radio and processing resource allocation problem in the context of a Cloud-based Radio Access Network (C-RAN). We formulate the auction as an Integer Linear Program (ILP), taking into accurate account interference constraints while leveraging radio resource reuse to generate an optimal revenue for the RAN operator. Then, we propose Truthful Greedy Approach (TGA), an effective and truthful heuristic that guarantees a close-to-optimum revenue compared to the one obtained with the ILP formulation. Extensive simulations, conducted in representative network scenarios, compare and evaluate our auction with state-of-the-art approaches from the literature, showing its effectiveness.

AB - In this paper, we propose a truthful combinatorial auction for the joint radio and processing resource allocation problem in the context of a Cloud-based Radio Access Network (C-RAN). We formulate the auction as an Integer Linear Program (ILP), taking into accurate account interference constraints while leveraging radio resource reuse to generate an optimal revenue for the RAN operator. Then, we propose Truthful Greedy Approach (TGA), an effective and truthful heuristic that guarantees a close-to-optimum revenue compared to the one obtained with the ILP formulation. Extensive simulations, conducted in representative network scenarios, compare and evaluate our auction with state-of-the-art approaches from the literature, showing its effectiveness.

KW - C-RAN

KW - Combinatorial auction

KW - Multi-resource allocation

KW - Truthfulness

U2 - 10.1109/ICC.2019.8762077

DO - 10.1109/ICC.2019.8762077

M3 - Conference contribution

AN - SCOPUS:85070203224

T3 - IEEE International Conference on Communications

BT - 2019 IEEE International Conference on Communications, ICC 2019 - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2019 IEEE International Conference on Communications, ICC 2019

Y2 - 20 May 2019 through 24 May 2019

ER -

A Combinatorial Auction for Joint Radio and Processing Resource Allocation in C-RAN

Résumé

Série de publications

Une conférence

SDG des Nations Unies

Accès au document

Empreinte digitale

Contient cette citation