Mobile caching policies for device-to-device (D2D) content delivery networking

Hye J. Kang, Kown Y. Park, Kumin Cho, Chung Gu Kang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

63 Citations (Scopus)

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 languageEnglish
Title of host publicationProceedings - IEEE INFOCOM
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages299-304
Number of pages6
ISBN (Print)9781479930883
DOIs
Publication statusPublished - 2014 Jan 1
Event2014 IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2014 - Toronto, ON, Canada
Duration: 2014 Apr 272014 May 2

Other

Other2014 IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2014
CountryCanada
CityToronto, ON
Period14/4/2714/5/2

Fingerprint

Servers
Mobile devices
Telecommunication links

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

Kang, H. J., Park, K. Y., Cho, K., & Kang, C. G. (2014). Mobile caching policies for device-to-device (D2D) content delivery networking. In Proceedings - IEEE INFOCOM (pp. 299-304). [6849248] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/INFCOMW.2014.6849248

Mobile caching policies for device-to-device (D2D) content delivery networking. / Kang, Hye J.; Park, Kown Y.; Cho, Kumin; Kang, Chung Gu.

Proceedings - IEEE INFOCOM. Institute of Electrical and Electronics Engineers Inc., 2014. p. 299-304 6849248.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kang, HJ, Park, KY, Cho, K & Kang, CG 2014, Mobile caching policies for device-to-device (D2D) content delivery networking. in Proceedings - IEEE INFOCOM., 6849248, Institute of Electrical and Electronics Engineers Inc., pp. 299-304, 2014 IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2014, Toronto, ON, Canada, 14/4/27. https://doi.org/10.1109/INFCOMW.2014.6849248
Kang HJ, Park KY, Cho K, Kang CG. Mobile caching policies for device-to-device (D2D) content delivery networking. In Proceedings - IEEE INFOCOM. Institute of Electrical and Electronics Engineers Inc. 2014. p. 299-304. 6849248 https://doi.org/10.1109/INFCOMW.2014.6849248
Kang, Hye J. ; Park, Kown Y. ; Cho, Kumin ; Kang, Chung Gu. / Mobile caching policies for device-to-device (D2D) content delivery networking. Proceedings - IEEE INFOCOM. Institute of Electrical and Electronics Engineers Inc., 2014. pp. 299-304
@inproceedings{cdda2b7020a04f4b9237a6bbf743ec0f,
title = "Mobile caching policies for device-to-device (D2D) content delivery networking",
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.",
keywords = "Caching Probability, Caching Server Device, Device-to-device Communication, Mobile Contents Distribution Network (CDN), Poisson Point Process",
author = "Kang, {Hye J.} and Park, {Kown Y.} and Kumin Cho and Kang, {Chung Gu}",
year = "2014",
month = "1",
day = "1",
doi = "10.1109/INFCOMW.2014.6849248",
language = "English",
isbn = "9781479930883",
pages = "299--304",
booktitle = "Proceedings - IEEE INFOCOM",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Mobile caching policies for device-to-device (D2D) content delivery networking

AU - Kang, Hye J.

AU - Park, Kown Y.

AU - Cho, Kumin

AU - Kang, Chung Gu

PY - 2014/1/1

Y1 - 2014/1/1

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

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

KW - Caching Probability

KW - Caching Server Device

KW - Device-to-device Communication

KW - Mobile Contents Distribution Network (CDN)

KW - Poisson Point Process

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

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

U2 - 10.1109/INFCOMW.2014.6849248

DO - 10.1109/INFCOMW.2014.6849248

M3 - Conference contribution

AN - SCOPUS:84904473341

SN - 9781479930883

SP - 299

EP - 304

BT - Proceedings - IEEE INFOCOM

PB - Institute of Electrical and Electronics Engineers Inc.

ER -