Cache hit ratio maximization in device-to-device communications overlaying cellular networks

  title={Cache hit ratio maximization in device-to-device communications overlaying cellular networks},
  author={Liang Zhong and Xueqiang Zheng and Yong Liu and Mengting Wang and Yang Cao},
  journal={China Communications},
This paper investigates the content placement problem to maximize the cache hit ratio in device-to-device (D2D) communications overlaying cellular networks. We consider offloading contents by users themselves, D2D communications and multicast, and we analyze the relationship between these offloading methods and the cache hit ratio. Based on this relationship, we formulate the content placement optimization as a cache hit ratio maximization problem, and propose a heuristic algorithm to solve it… 

Figures from this paper

D2D Assisted Cellular Networks in Licensed and Unlicensed Spectrum: Matching-Iteration-Based Joint User Access and Resource Allocation
Simulation results show that the proposed matching-iteration-based joint user access and resource allocation algorithm can significantly improve system throughput compared to the other benchmark algorithms.


Base-Station Assisted Device-to-Device Communications for High-Throughput Wireless Video Networks
It is shown that an improvement of spectral efficiency of one to two orders of magnitude is possible, even if there is not very high redundancy in video requests, and even a purely random caching scheme shows only a minor performance loss.
Cache in the air: exploiting content caching and delivery techniques for 5G systems
A novel edge caching scheme based on the concept of content-centric networking or information-centric networks is proposed and evaluated, using trace-driven simulations to evaluate the performance of the proposed scheme and validate the various advantages of the utilization of caching content in 5G mobile networks.
Device-to-device communication as an underlay to LTE-advanced networks
In this article device-to-device (D2D) communication underlaying a 3GPP LTE-Advanced cellular network is studied as an enabler of local services with limited interference impact on the primary
FemtoCaching: Wireless Content Delivery Through Distributed Caching Helpers
This work shows that the uncoded optimum file assignment is NP-hard, and develops a greedy strategy that is provably within a factor 2 of the optimum, and provides an efficient algorithm achieving a provably better approximation ratio of 1-1/d d, where d is the maximum number of helpers a user can be connected to.
Fundamental limits of caching
This paper proposes a novel caching approach that can achieve a significantly larger reduction in peak rate compared to previously known caching schemes, and argues that the performance of the proposed scheme is within a constant factor from the information-theoretic optimum for all values of the problem parameters.
Distributed Cooperative Caching in Social Wireless Networks
Drawing motivation from Amazon's Kindle electronic book delivery business, practical network, service, and pricing models are developed which are then used for creating two object caching strategies for minimizing content provisioning costs in networks with homogenous and heterogeneous object demands.
Modeling Heterogeneous Network Interference Using Poisson Point Processes
This paper proposes to analyze downlink performance in a fixed-size cell, which is inscribed within a weighted Voronoi cell in a Poisson field of interferers, using recent applications of stochastic geometry to analyze cellular systems.
Modeling TTL-based Internet caches
  • Jaeyeon Jung, A. Berger, H. Balakrishnan
  • Computer Science
    IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428)
  • 2003
A way of modeling the hit rates of caches that use a time-to-live (TTL)-based consistency policy as a function of request arrival times and the choice of TTL, enabling us to better understand cache behavior for shorter TTL periods.
Web caching and Zipf-like distributions: evidence and implications
  • L. Breslau, P. Cao, Li Fan, Graham Phillips, S. Shenker
  • Computer Science
    IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320)
  • 1999
This paper investigates the page request distribution seen by Web proxy caches using traces from a variety of sources and considers a simple model where the Web accesses are independent and the reference probability of the documents follows a Zipf-like distribution, suggesting that the various observed properties of hit-ratios and temporal locality are indeed inherent to Web accesse observed by proxies.
The LRU-K page replacement algorithm for database disk buffering
The LRU-K algorithm surpasses conventional buffering algorithms in discriminating between frequently and infrequently referenced pages, and adapts in real time to changing patterns of access.