publication . Conference object . Other literature type . 2018

DR-Cache: Distributed Resilient Caching with Latency Guarantees

Jian Li; Truong Khoa Phan; Wei Koong Chai; Daphne Tuncer; George Pavlou; David Griffin; Miguel Rio;
Open Access English
  • Published: 17 Apr 2018
  • Country: United Kingdom
The dominant application in today's Internet is content streaming, which is increasingly relying on caches to meet the stringent conditions on the latency between content servers and end-users. These systems routinely face the challenges of limited bandwidth capacities and network server failures, which degrade caching performance. In this paper, we study the problem of optimally allocating content over a resilient caching network, in which each cache may fail under some situations. Given content request rates and multiple routing paths, we formulate an optimization problem to maximize the expected caching gain, i.e., the reduction of latency due to intermediate...
ACM Computing Classification System: Hardware_MEMORYSTRUCTURES
Funded by
Programmable edge-to-cloud virtualization fabric for the 5G Media industry
  • Funder: European Commission (EC)
  • Project Code: 761699
  • Funding stream: H2020 | IA
Download fromView all 6 versions
Other literature type . 2018
Provider: Datacite
UCL Discovery
Conference object . 2018
Other literature type . 2018
Provider: Datacite
28 references, page 1 of 2

[1] 856595126.

[2] D. Applegate, A. Archer, V. Gopalakrishnan, S. Lee, and K. K. Ramakrishnan. Optimal Content Placement for a Large-Scale VoD System. IEEE/ACM Transactions on Networking, 24:2114 - 2127, 2016.

[3] I. Baev, R. Rajaraman, and C. Swamy. Approximation Algorithms for Data Placement Problems. SIAM Jour. Comp., 38(4):1411-1429, 2008.

[4] G. Bianchi, A. Detti, A. Caponi, and N. Blefari Melazzi. Check before Storing: What is the Performance Price of Content Integrity Verification in LRU Caching? ACM SIGCOMM CCR, 2013. [OpenAIRE]

[5] S. Borst, V. Gupta, and A. Walid. Distributed Caching Algorithms for Content Distribution Networks. In IEEE INFOCOM, 2010.

[6] W. K. Chai, V. Sourlas, and G. Pavlou. Providing Information Resilience Through Modularity-based Caching in Perturbed Information-centric Networks. In IEEE/ACM International Teletraffic Congress, 2017.

[7] H. Che, Y. Tung, and Z. Wang. Hierarchical Web Caching Systems: Modeling, Design and Experimental Results. Selected Areas in Communications, IEEE Journal on, 20(7):1305-1314, 2002.

[8] C. Chekuri, J. Vondrak, and R. Zenklusen. Dependent Randomized Rounding via Exchange Properties of Combinatorial Structures. In IEEE FOCS, 2010. [OpenAIRE]

[9] E. Cohen and S. Shenker. Replication Strategies in Unstructured Peerto-Peer Networks. In ACM SIGCOMM, 2002.

[10] M. Dehghan, A. Seetharam, B. Jiang, T. He, T. Salonidis, J. Kurose, D. Towsley, and R. Sitaraman. On the Complexity of Optimal Routing and Content Caching in Heterogeneous Networks. In IEEE INFOCOM, 2015.

[11] S. Ghemawat, H. Gobioff, and S.-T. Leung. The Google File System. In ACM SIGOPS Operating Systems Review, 2003. [OpenAIRE]

[12] P. Gill, N. Jain, and N. Nagappan. Understanding Network Failures in Data Centers: Measurement, Analysis, and Implications. In ACM SIGCOMM, 2011.

[13] N. Golrezaei, K. Shanmugam, A. G. Dimakis, A. F. Molisch, and G. Caire. Femtocaching: Wireless Video Content Delivery Through Distributed Caching Helpers. In IEEE INFOCOM, 2012. [OpenAIRE]

[14] I. Hou, T. Zhao, S. Wang, and K. Chan. Asymptotically Optimal Algorithm for Online Reconfiguration of Edge-Clouds. In ACM MobiHoc, 2016.

[15] S. Ioannidis and E. Yeh. Adaptive Caching Networks with Optimality Guarantees. In ACM SIGMETRICS, 2016.

28 references, page 1 of 2
Powered by OpenAIRE Research Graph
Any information missing or wrong?Report an Issue