Skip to Main content Skip to Navigation
Conference papers

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. I. INTRODUCTION During the last decade, the rapid proliferation of smart-phones coupled with the rising popularity of Online Social Networks (OSNs) have led to an exponential growth of mobile video traffic [1]. Meanwhile, existing wireless networks have already reached their capacity limits, especially during peak hours [2]. In order to ensure acceptable Quality of Experience (QoE) for the end-users, the next generation of wireless net-works will consist of a very dense deployment of low-cost and low-power small base stations (SBSs) [3]. The SBSs provide a cost-effective way to offload traffic from the main macro-cellular networks. However, the prospective performance gains expected from SBS deployment will be limited by capacity-limited and possibly heterogeneous backhaul links that connect the SBSs to the core network [3]. Indeed, the solution of deploying high speed fiber-optic backhaul is too expensive and thus, the use of DSL backhaul connections need to be considered [4]. Distributed caching at the network edge is considered as a promising solution to deal with the backhaul bottleneck [5], [6]. The basic idea is to duplicate and store the data at the SBSs side. Consequently, users' requests can be served locally, from the closest SBSs without using the backhaul links, when possible. In prior works, the cache placement problem has been mainly addressed for wired networks, especially for Content Delivery Networks (CDNs) [7]–[10]. However, the CDNs topology is different from the small cell networks topology since the CDNs' caching servers are part of the core network while the SBSs are connected to the core network and the User Equipments (UE) via backhaul and radio links, respectively. Hence, it is necessary to explore new cache
Document type :
Conference papers
Complete list of metadatas

Cited literature [27 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01098882
Contributor : Matha Deghel <>
Submitted on : Monday, December 29, 2014 - 11:11:19 PM
Last modification on : Monday, December 14, 2020 - 2:36:02 PM
Long-term archiving on: : Monday, March 30, 2015 - 10:35:21 AM

File

1405.5390v1.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Kenza Hamidouche, Walid Saad, Mérouane Debbah. Many-to-many matching games for proactive social-caching in wireless small cell networks. 12th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt), May 2014, Hammamet, Tunisia. pp.569 - 574, ⟨10.1109/WIOPT.2014.6850348⟩. ⟨hal-01098882⟩

Share

Metrics

Record views

312

Files downloads

412