Proactive Content Distribution for dynamic content

We study the bounds and means of optimal caching in overlay Content Distribution Networks (CDN) that serve data with dynamic content to end-users who send random requests for the most up-to-date version of such content. Applications with such dynamic content are numerous, including daily news, weather conditions, stock market prices, social networking messages, etc. The service for such a dynamically changing content necessitates a fundamentally different approach than traditional pull-based (also called non-proactive) schemes. In particular, proactive caching is required to optimize the type and amount of content to be updated in the local servers of a CDN hence minimize the transmission and caching costs, subject to storage constraints. We study the metric of cost reduction achieved by proactive caching over non-proactive caching strategies. We introduce the notion of popularity to establish fundamental upper and lower bounds on cost reduction under different degrees of storage space constraints. We prove the lower bounds to achieve the optimal rate of increase achieved by the upper bounds as the database of items increases. In particular, for a general form of convex, superlinear and monotonically increasing cost functions, our results reveal that the optimal cost reduction scales as the cost function itself, or at least as its first derivative, depending on the number of popular data items, as well as the cache storage capacity.

[1]  Atilla Eryilmaz,et al.  Proactive resource allocation: Turning predictable behavior into spectral gain , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[2]  Rajkumar Buyya,et al.  A Taxonomy and Survey of Content Delivery Networks , 2006 .

[3]  George Pallis,et al.  Content Delivery Networks: Status and Trends , 2003, IEEE Internet Comput..

[4]  Atilla Eryilmaz,et al.  Proactive resource allocation in cognitive networks , 2011, 2011 Conference Record of the Forty Fifth Asilomar Conference on Signals, Systems and Computers (ASILOMAR).

[5]  Atilla Eryilmaz,et al.  Proactive multicasting with predictable demands , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[6]  Jussi Kangasharju,et al.  Object replication strategies in content distribution networks , 2002, Comput. Commun..

[7]  Pablo Rodriguez,et al.  I tube, you tube, everybody tubes: analyzing the world's largest user generated content video system , 2007, IMC '07.

[8]  Asuman E. Ozdaglar,et al.  On the Delay and Throughput Gains of Coding in Unreliable Networks , 2008, IEEE Transactions on Information Theory.

[9]  George Pallis,et al.  Insight and perspectives for content delivery networks , 2006, CACM.

[10]  Parimal Parag,et al.  Content-aware caching and traffic management in content distribution networks , 2011, 2011 Proceedings IEEE INFOCOM.

[11]  Pangfeng Liu,et al.  Optimal replica placement strategy for hierarchical data grid systems , 2006, Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06).

[12]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[13]  Atsushi Iwata,et al.  Coarse-grain replica management strategies for dynamic replication of Web contents , 2004, Comput. Networks.

[14]  Lili Qiu,et al.  On the placement of Web server replicas , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[15]  Konstantinos Psounis,et al.  Efficient randomized web-cache replacement schemes using samples from past eviction times , 2002, TNET.

[16]  Alexandros G. Dimakis,et al.  Network Coding for Distributed Storage Systems , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[17]  Albert-László Barabási,et al.  Limits of Predictability in Human Mobility , 2010, Science.

[18]  Randy H. Katz,et al.  Dynamic Replica Placement for Scalable Content Delivery , 2002, IPTPS.