Abstract
We consider a mobile content delivery network (mCDN) in which special mobile devices designated as caching servers (caching-server device: CSD) can provide mobile stations with popular contents on demand via device-to-device (D2D) communication links. On the assumption that mobile CSD's are randomly distributed by a Poisson point process (PPP), an optimization problem is formulated to determine the probability of storing the individual content in each server in a manner that minimizes the average caching failure rate. Further, we present a low-complexity search algorithm, optimum dual-solution searching algorithm (ODSA), for solving this optimization problem. We demonstrate that the proposed ODSA takes fewer iterations, on the order of O(log N) searches, for caching N contents in the system to find the optimal solution, as compared to the number of iterations in the conventional subgradient method, with an acceptable accuracy in practice. Furthermore, we identify the important characteristics of the optimal caching policies in the mobile environment that would serve as a useful aid in designing the mCDN.
| Original language | English |
|---|---|
| Pages (from-to) | 568-577 |
| Number of pages | 10 |
| Journal | Journal of Communications and Networks |
| Volume | 16 |
| Issue number | 5 |
| DOIs | |
| Publication status | Published - 2014 Oct 1 |
Keywords
- Caching probability
- Caching server device
- Device-to-device (D2D) communication
- Mobile contents distributed network (mCDN)
- Poisson point process (PPP)
ASJC Scopus subject areas
- Information Systems
- Computer Networks and Communications