MC3: A Cloud Caching Strategy for Next Generation Virtual Content Distribution Networks

被引:0
作者
Marchetta, Pietro [1 ]
Llorca, Jaime [3 ]
Tulino, Antonia M. [1 ,3 ]
Pescape, Antonio [1 ,2 ]
机构
[1] Univ Naples Federico II, Naples, Italy
[2] NM2 Srl, Naples, Italy
[3] Nokia, Bell Labs, New Providence, NJ USA
来源
2016 IFIP NETWORKING CONFERENCE (IFIP NETWORKING) AND WORKSHOPS | 2016年
关键词
PLACEMENT;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
With the advent of network functions virtualization and software defined networking, cloud content distribution network (CDN) providers can auto-scale their virtual CDN appliances in order to meet changing demands for commercial and user generated content services in a cost and energy efficient manner. However, existing caching policies, constrained to work with dedicated CDN resources and designed to maximize local cache hit rates, do not exploit the elasticity of virtualized cloud environments to adaptively guarantee service requirements with minimum cost. In this paper, we design and evaluate MC3 (MinCostCloudCache), an adaptive distributed caching strategy whose fundamental goal is to guarantee content service requirements while minimizing the use and associated cost of the shared physical infrastructure. MC3 estimates the global benefit of caching an object at a network node using only locally available information. The caching benefit is flexible and adaptive to the particular content service requirements, and is aware of the behavior of neighbor network caches, creating effective cache cooperation using only local information. Through simulation, we show how MC3 not only reduces the experienced average delay with respect to existing caching policies, but it also uses significantly less storage and transport resources, leading to increased revenues and reduced operational costs.
引用
收藏
页码:332 / 340
页数:9
相关论文
共 23 条
[1]  
Akhtar S., P 23 ACM INT C MULT, P421
[2]  
[Anonymous], 2001, P EUR SIM MULT ESM 2
[3]  
[Anonymous], THE FUTURE X NETWORK
[4]  
[Anonymous], 2013, PROGRAMMABLE CLOUD N
[5]  
Baev I. D., 2001, ACM SODA 01
[6]   APPROXIMATION ALGORITHMS FOR DATA PLACEMENT PROBLEMS [J].
Baev, Ivan ;
Rajaraman, Rajmohan ;
Swamy, Chaitanya .
SIAM JOURNAL ON COMPUTING, 2008, 38 (04) :1411-1429
[7]  
Balachandran A., 2013, Proceedings of the 2013 conference on Internet measurement conference, P43, DOI DOI 10.1145/2504730.2504743
[8]   Distributed Caching Algorithms for Content Distribution Networks [J].
Borst, Sem ;
Gupta, Varun ;
Walid, Anwar .
2010 PROCEEDINGS IEEE INFOCOM, 2010,
[9]  
Breslau L, 1999, IEEE INFOCOM SER, P126, DOI 10.1109/INFCOM.1999.749260
[10]  
Cao P, 1997, PROCEEDINGS OF THE USENIX SYMPOSIUM ON INTERNET TECHNOLOGIES AND SYSTEMS, P193