Mobile Device-to-Device (D2D) content delivery networking

A design and optimization framework

Hye Joong Kang, Chung Gu Kang

Research output: Contribution to journalArticle

31 Citations (Scopus)

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 languageEnglish
Pages (from-to)568-577
Number of pages10
JournalJournal of Communications and Networks
Volume16
Issue number5
DOIs
Publication statusPublished - 2014 Jan 1

Fingerprint

Mobile devices
Servers
Telecommunication links

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems

Cite this

Mobile Device-to-Device (D2D) content delivery networking : A design and optimization framework. / Kang, Hye Joong; Kang, Chung Gu.

In: Journal of Communications and Networks, Vol. 16, No. 5, 01.01.2014, p. 568-577.

Research output: Contribution to journalArticle

@article{f275a59b7f6348fabbd2b7ce1518cb9b,
title = "Mobile Device-to-Device (D2D) content delivery networking: A design and optimization framework",
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.",
keywords = "Caching probability, Caching server device, Device-to-device (D2D) communication, Mobile contents distributed network (mCDN), Poisson point process (PPP)",
author = "Kang, {Hye Joong} and Kang, {Chung Gu}",
year = "2014",
month = "1",
day = "1",
doi = "10.1109/JCN.2014.000095",
language = "English",
volume = "16",
pages = "568--577",
journal = "Journal of Communications and Networks",
issn = "1229-2370",
publisher = "Korean Institute of Communication Sciences",
number = "5",

}

TY - JOUR

T1 - Mobile Device-to-Device (D2D) content delivery networking

T2 - A design and optimization framework

AU - Kang, Hye Joong

AU - Kang, Chung Gu

PY - 2014/1/1

Y1 - 2014/1/1

N2 - 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.

AB - 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.

KW - Caching probability

KW - Caching server device

KW - Device-to-device (D2D) communication

KW - Mobile contents distributed network (mCDN)

KW - Poisson point process (PPP)

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

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

U2 - 10.1109/JCN.2014.000095

DO - 10.1109/JCN.2014.000095

M3 - Article

VL - 16

SP - 568

EP - 577

JO - Journal of Communications and Networks

JF - Journal of Communications and Networks

SN - 1229-2370

IS - 5

ER -