Hyppää sisältöön
    • FI
    • ENG
  • FI
  • /
  • EN
OuluREPO – Oulun yliopiston julkaisuarkisto / University of Oulu repository
Näytä viite 
  •   OuluREPO etusivu
  • Oulun yliopisto
  • Avoin saatavuus
  • Näytä viite
  •   OuluREPO etusivu
  • Oulun yliopisto
  • Avoin saatavuus
  • Näytä viite
JavaScript is disabled for your browser. Some features of this site may not work without it.

Joint cache allocation with incentive and user association in cloud radio access networks using hierarchical game

Le, Tra Huong Thi; Tran, Nguyen H.; Vo, Phuong Luu; Han, Zhu; Bennis, Mehdi; Hong, Choong Seon (2019-02-15)

 
Avaa tiedosto
nbnfi-fe2019101532721.pdf (4.607Mt)
nbnfi-fe2019101532721_meta.xml (37.76Kt)
nbnfi-fe2019101532721_solr.xml (39.72Kt)
Lataukset: 

URL:
https://doi.org/10.1109/ACCESS.2019.2896637

Le, Tra Huong Thi
Tran, Nguyen H.
Vo, Phuong Luu
Han, Zhu
Bennis, Mehdi
Hong, Choong Seon
Institute of Electrical and Electronics Engineers
15.02.2019

T. H. T. Le, N. H. Tran, P. L. Vo, Z. Han, M. Bennis and C. S. Hong, "Joint Cache Allocation With Incentive and User Association in Cloud Radio Access Networks Using Hierarchical Game," in IEEE Access, vol. 7, pp. 20773-20788, 2019. doi: 10.1109/ACCESS.2019.2896637

https://rightsstatements.org/vocab/InC/1.0/
© 2019 IEEE. Translations and content mining are permitted for academic research only. Personal use is also permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
https://rightsstatements.org/vocab/InC/1.0/
doi:https://doi.org/10.1109/ACCESS.2019.2896637
Näytä kaikki kuvailutiedot
Julkaisun pysyvä osoite on
https://urn.fi/URN:NBN:fi-fe2019101532721
Tiivistelmä

Abstract

In this paper, we consider a cloud radio access network-based system consisting of one network operator (NO) and several content providers (CPs). The NO owns a cloud cache and provides caching as a service for CPs, who provide contents to users. While the NO wishes to motivate CPs to rent its cache and maximize its profit, CPs want to optimize the service performance for users and their renting utilities. Due to the time separation between cache allocation and user association problems, we model the interactions between the NO and CPs as a hierarchical game, i.e., a cache renting scheme between the NO and CPs in the cache allocation problem and the willingness of CPs in the user association problem. In the cache allocation problem, we propose a contract theory-based incentive mechanism in which the NO designs and offers an optimal contract to various types of CPs. We then formulate the user association problem as a many-to-many matching game with externalities. To solve this matching game, we propose a matching algorithm that converges to a two-sided exchange stable matching with low complexity. The simulation results demonstrate that this proposed approach is beneficial to the NO’s profit and incentivize the CP to rent the cache with truthful private information. In addition, the system performance of the proposed approach in terms of the total data rate-delay tradeoff outperforms than the benchmarks.

Kokoelmat
  • Avoin saatavuus [37798]
oulurepo@oulu.fiOulun yliopiston kirjastoOuluCRISLaturiMuuntaja
SaavutettavuusselosteTietosuojailmoitusYlläpidon kirjautuminen
 

Selaa kokoelmaa

NimekkeetTekijätJulkaisuajatAsiasanatUusimmatSivukartta

Omat tiedot

Kirjaudu sisäänRekisteröidy
oulurepo@oulu.fiOulun yliopiston kirjastoOuluCRISLaturiMuuntaja
SaavutettavuusselosteTietosuojailmoitusYlläpidon kirjautuminen