Abstract
We consider a mobile content delivery network (mCDN) in which a special form of mobile devices designated as caching servers (caching-server device: CSD) can provide the near-by devices with some popular contents on demand via device-to-device (D2D) communication links. On the assumption that mobile CSDs 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 identify the important characteristics of the optimal caching policies in the mobile environment that would serve as a useful aid in designing an mCDN.
Original language | English |
---|---|
Title of host publication | Proceedings - IEEE INFOCOM |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Pages | 299-304 |
Number of pages | 6 |
ISBN (Print) | 9781479930883 |
DOIs | |
Publication status | Published - 2014 Jan 1 |
Event | 2014 IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2014 - Toronto, ON, Canada Duration: 2014 Apr 27 → 2014 May 2 |
Other
Other | 2014 IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2014 |
---|---|
Country/Territory | Canada |
City | Toronto, ON |
Period | 14/4/27 → 14/5/2 |
ASJC Scopus subject areas
- General Computer Science
- Electrical and Electronic Engineering