Mobile Caching Policies for Device-to-Device (D2D) Content Delivery Networking

被引:0
作者
Kang, Hye J. [1 ]
Park, Kown Y. [1 ]
Cho, Kumin [1 ]
Kang, Chung G. [1 ]
机构
[1] Korea Univ, Sch Elect Engn, Seoul, South Korea
来源
2014 IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS (INFOCOM WKSHPS) | 2014年
关键词
Mobile Contents Distribution Network (CDN); Device-to-device Communication; Caching Probability; Caching Server Device; Poisson Point Process;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:299 / 304
页数:6
相关论文
共 7 条
[1]  
[Anonymous], 2012, P802161AD2 IEEE
[2]   An Aloha protocol for multihop mobile wireless networks [J].
Baccelli, F ;
Blaszczyszyn, B ;
Mühlethaler, P .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (02) :421-436
[3]  
Boyd S., 2008, NOTES STANFORD U
[4]   Device-to-Device Communication as an Underlay to LTE-Advanced Networks [J].
Doppler, Klaus ;
Rinne, Mika ;
Wijting, Carl ;
Ribeiro, Cassio B. ;
Hugl, Klaus .
IEEE COMMUNICATIONS MAGAZINE, 2009, 47 (12) :42-49
[5]  
Golrezaei N., 2012, ARXIV12041595V1CSNI
[6]  
Golrezaei N., 2012, ARXIV12057044V1CSIT
[7]   Optimization flow control - I: Basic algorithm and convergence [J].
Low, SH ;
Lapsley, DE .
IEEE-ACM TRANSACTIONS ON NETWORKING, 1999, 7 (06) :861-874