Many-to-many matching games for proactive social-caching in wireless small cell networks

Kenza Hamidouche, Walid Saad, Merouane Debbah

Research output: Chapter in Book/Report/Conference proceedingConference contribution

64 Citations (Scopus)

Abstract

In this paper, we address the caching problem in small cell networks from a game theoretic point of view. In particular, we formulate the caching problem as a many-to-many matching game between small base stations and service providers' servers. The servers store a set of videos and aim to cache these videos at the small base stations in order to reduce the experienced delay by the end-users. On the other hand, small base stations cache the videos according to their local popularity, so as to reduce the load on the backhaul links. We propose a new matching algorithm for the many-to-many problem and prove that it reaches a pairwise stable outcome. Simulation results show that the number of satisfied requests by the small base stations in the proposed caching algorithm can reach up to three times the satisfaction of a random caching policy. Moreover, the expected download time of all the videos can be reduced significantly.

Original languageEnglish
Title of host publication2014 12th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2014
PublisherIEEE Computer Society
Pages569-574
Number of pages6
ISBN (Print)9783901882630
DOIs
StatePublished - Jan 1 2014
Event2014 12th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2014 - Hammamet, Tunisia
Duration: May 12 2014May 16 2014

Other

Other2014 12th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2014
CountryTunisia
CityHammamet
Period5/12/145/16/14

Fingerprint

Many to many
Caching
Base stations
Game
Cell
Cache
Servers
Server
Matching Algorithm
Pairwise
Simulation

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Modeling and Simulation

Cite this

Hamidouche, K., Saad, W., & Debbah, M. (2014). Many-to-many matching games for proactive social-caching in wireless small cell networks. In 2014 12th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2014 (pp. 569-574). [6850348] IEEE Computer Society. https://doi.org/10.1109/WIOPT.2014.6850348

Many-to-many matching games for proactive social-caching in wireless small cell networks. / Hamidouche, Kenza; Saad, Walid; Debbah, Merouane.

2014 12th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2014. IEEE Computer Society, 2014. p. 569-574 6850348.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Hamidouche, K, Saad, W & Debbah, M 2014, Many-to-many matching games for proactive social-caching in wireless small cell networks. in 2014 12th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2014., 6850348, IEEE Computer Society, pp. 569-574, 2014 12th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2014, Hammamet, Tunisia, 5/12/14. https://doi.org/10.1109/WIOPT.2014.6850348
Hamidouche K, Saad W, Debbah M. Many-to-many matching games for proactive social-caching in wireless small cell networks. In 2014 12th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2014. IEEE Computer Society. 2014. p. 569-574. 6850348 https://doi.org/10.1109/WIOPT.2014.6850348
Hamidouche, Kenza ; Saad, Walid ; Debbah, Merouane. / Many-to-many matching games for proactive social-caching in wireless small cell networks. 2014 12th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2014. IEEE Computer Society, 2014. pp. 569-574
@inproceedings{4ca0c95a566f41daa771a7e56fee52c9,
title = "Many-to-many matching games for proactive social-caching in wireless small cell networks",
abstract = "In this paper, we address the caching problem in small cell networks from a game theoretic point of view. In particular, we formulate the caching problem as a many-to-many matching game between small base stations and service providers' servers. The servers store a set of videos and aim to cache these videos at the small base stations in order to reduce the experienced delay by the end-users. On the other hand, small base stations cache the videos according to their local popularity, so as to reduce the load on the backhaul links. We propose a new matching algorithm for the many-to-many problem and prove that it reaches a pairwise stable outcome. Simulation results show that the number of satisfied requests by the small base stations in the proposed caching algorithm can reach up to three times the satisfaction of a random caching policy. Moreover, the expected download time of all the videos can be reduced significantly.",
author = "Kenza Hamidouche and Walid Saad and Merouane Debbah",
year = "2014",
month = "1",
day = "1",
doi = "10.1109/WIOPT.2014.6850348",
language = "English",
isbn = "9783901882630",
pages = "569--574",
booktitle = "2014 12th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2014",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - Many-to-many matching games for proactive social-caching in wireless small cell networks

AU - Hamidouche, Kenza

AU - Saad, Walid

AU - Debbah, Merouane

PY - 2014/1/1

Y1 - 2014/1/1

N2 - In this paper, we address the caching problem in small cell networks from a game theoretic point of view. In particular, we formulate the caching problem as a many-to-many matching game between small base stations and service providers' servers. The servers store a set of videos and aim to cache these videos at the small base stations in order to reduce the experienced delay by the end-users. On the other hand, small base stations cache the videos according to their local popularity, so as to reduce the load on the backhaul links. We propose a new matching algorithm for the many-to-many problem and prove that it reaches a pairwise stable outcome. Simulation results show that the number of satisfied requests by the small base stations in the proposed caching algorithm can reach up to three times the satisfaction of a random caching policy. Moreover, the expected download time of all the videos can be reduced significantly.

AB - In this paper, we address the caching problem in small cell networks from a game theoretic point of view. In particular, we formulate the caching problem as a many-to-many matching game between small base stations and service providers' servers. The servers store a set of videos and aim to cache these videos at the small base stations in order to reduce the experienced delay by the end-users. On the other hand, small base stations cache the videos according to their local popularity, so as to reduce the load on the backhaul links. We propose a new matching algorithm for the many-to-many problem and prove that it reaches a pairwise stable outcome. Simulation results show that the number of satisfied requests by the small base stations in the proposed caching algorithm can reach up to three times the satisfaction of a random caching policy. Moreover, the expected download time of all the videos can be reduced significantly.

UR - http://www.scopus.com/inward/record.url?scp=84904964513&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84904964513&partnerID=8YFLogxK

U2 - 10.1109/WIOPT.2014.6850348

DO - 10.1109/WIOPT.2014.6850348

M3 - Conference contribution

SN - 9783901882630

SP - 569

EP - 574

BT - 2014 12th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2014

PB - IEEE Computer Society

ER -