research-article

Joint Data Compression and Caching: Approaching Optimality with Guarantees

Authors:

Ananthram SwamiAuthors Info & Claims

ICPE '18: Proceedings of the 2018 ACM/SPEC International Conference on Performance Engineering

Pages 229 - 240

https://doi.org/10.1145/3184407.3184410

Published: 30 March 2018 Publication History

Abstract

We consider the problem of optimally compressing and caching data across a communication network. Given the data generated at edge nodes and a routing path, our goal is to determine the optimal data compression ratios and caching decisions across the network in order to minimize average latency, which can be shown to be equivalent to maximizing the compression and caching gain under an energy consumption constraint. We show that this problem is NP-hard in general and the hardness is caused by the caching decision subproblem, while the compression sub-problem is polynomial-time solvable. We then propose an approximation algorithm that achieves a $(1-1/e)$-approximation solution to the optimum in strongly polynomial time. We show that our proposed algorithm achieve the near-optimal performance in synthetic-based evaluations. In this paper, we consider a tree-structured network as an illustrative example, but our results easily extend to general network topology at the expense of more complicated notations.

References

[1]

Alexander A Ageev and Maxim I Sviridenko. 2004. Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee. Journal of Combinatorial Optimization 8, 3 (2004), 307--328.

[2]

David Applegate, Aaron Archer, Vijay Gopalakrishnan, Seungjoon Lee, and KK Ramakrishnan. 2016. Optimal Content Placement for a Large-Scale VoD System. IEEE/ACM Transactions on Networking 24, 4 (2016), 2114--2127.

Digital Library

[3]

Ivan Baev, Rajmohan Rajaraman, and Chaitanya Swamy. 2008. Approximation Algorithms for Data Placement Problems. SIAM J. Comput. 38, 4 (2008), 1411-- 1429.

Digital Library

[4]

Kenneth C Barr and Krste Asanovi?. 2006. Energy-aware Lossless Data Compres- sion. ACM Transactions on Computer Systems (2006).

Digital Library

[5]

Pierre Bonami et al. 2008. An Algorithmic Framework for Convex Mixed Integer Nonlinear Programs. Disc. Opt. 5, 2 (2008), 186--204.

Digital Library

[6]

Sem Borst, Varun Gupta, and Anwar Walid. 2010. Distributed Caching Algorithms for Content Distribution Networks. In Proc. IEEE INFOCOM. 1--9.

Digital Library

[7]

Stephen Boyd and Lieven Vandenberghe. 2004. Convex Optimization. Cambridge University Press.

Digital Library

[8]

Gruia Calinescu, Chandra Chekuri, Martin Pál, and Jan Vondrák. 2007. Maximizing a Submodular Set Function Subject to a Matroid Constraint. In IPCO, Vol. 7. Springer, 182--196.

Digital Library

[9]

Nakjung Choi, Kyle Guan, Daniel C Kilper, and Gary Atkinson. 2012. In-network Caching Effect on Optimal Energy Consumption in Content-Centric Networking. In Proc. IEEE ICC.

[10]

Edith Cohen and Scott Shenker. 2002. Replication Strategies in Unstructured Peer-to-Peer Networks. In ACM SIGCOMM CCR, Vol. 32. 177--190.

Digital Library

[11]

G Cornnejols, M Fisher, and G Nemhauser. 1977. Location of Bank Accounts of Optimize Float: An Analytic Study of Exact and Approximate Algorithm. Management Science 23 (1977), 789--810.

Digital Library

[12]

Kalyanmoy Deb, Amrit Pratap, Sameer Agarwal, and TAMT Meyarivan. 2002. A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation 6, 2 (2002), 182--197.

Digital Library

[13]

Mostafa Dehghan, Anand Seetharam, Bo Jiang, Ting He, Theodoros Salonidis, Jim Kurose, Don Towsley, and Ramesh Sitaraman. 2015. On the Complexity of Optimal Routing and Content Caching in Heterogeneous Networks. In Proc. IEEE INFOCOM. 936--944.

[14]

Michel X. Goemans and David P. Williamson. 1994. NEW 3/4-APPROXIMATION ALGORITHMS FOR THE MAXIMUM SATISFIABILITY PROBLEM. SIAM Journal on Discrete Mathematics 7, 4 (1994).

Digital Library

[15]

Wendi Rabiner Heinzelman, Anantha Chandrakasan, and Hari Balakrishnan. 2000. Energy-Efficient Communication Protocol for Wireless Microsensor Networks. In System sciences.

[16]

Stratis Ioannidis and Edmund Yeh. 2016. Adaptive Caching Networks with Optimality Guarantees. In Proc. ACM SIGMETRICS. 113--124.

Digital Library

[17]

Stratis Ioannidis and Edmund Yeh. 2017. Jointly Optimal Routing and Caching for Arbitrary Network Topologies. arXiv preprint arXiv:1708.05999 (2017).

Digital Library

[18]

Van Jacobson, Diana K Smetters, James D Thornton, Michael F Plass, Nicholas H Briggs, and Rebecca L Braynard. 2009. Networking Named Content. In Proc. ACM CoNEXT. 1--12.

Digital Library

[19]

Anant Singh Jain and Sheik Meeran. 1999. Deterministic Job-Shop Scheduling: Past, Present and Future. European journal of operational research 113, 2 (1999).

[20]

Andreas Krause and Daniel Golovin. 2014. Submodular Function Maxi- mization. http://www.cs.cmu.edu/afs/.cs.cmu.edu/Web/People/dgolovin/papers/ submodular_survey12.pdf. (2014).

[21]

Sébastien Le Digabel. 2011. Algorithm 909: NOMAD: Nonlinear Optimization with the MADS Algorithm. ACM TOMS 37, 4 (2011), 44.

Digital Library

[22]

Jian Li, Truong Khoa Phan, Wei Koong Chai, Daphne Tuncer, George Pavlou, David Griffin, and Miguel Rio. 2018. DR-Cache: Distributed Resilient Caching with Latency Guarantees. In Proc. IEEE INFOCOM.

[23]

Jian Li, Srinivas Shakkottai, John C.S. Lui, and Vijay Subramanian. 2017. Accurate Learning or Fast Mixing? Dynamic Adaptability of Caching Algorithms. arXiv preprint arXiv:1701.02214 (2017).

[24]

Jian Li, Faheem Zafari, Don Towsley, Kin K. Leung, and Aanathram Swami. 2018. Joint Data Compression and Caching: Approaching Optimality with Guarantees. Arxiv preprint arXiv:1801.02099 (2018).

[25]

A. Manjeshwar and D. P. Agrawal. 2001. TEEN: a Routing Protocol for Enhanced Efficiency in Wireless Sensor Networks. In IPDPS.

Digital Library

[26]

Sepideh Nazemi, Kin K Leung, and Ananthram Swami. 2016. QoI-aware Tradeoff Between Communication and Computation in Wireless Ad-hoc Networks. In Proc. IEEE PIMRC.

[27]

Nitish K. Panigrahy, Jian Li, and Don Towsley. 2017. Hit Rate vs. Hit Probability Based Cache Utility Maximization. In Proc. ACM MAMA.

Digital Library

[28]

Nitish K. Panigrahy, Jian Li, and Don Towsley. 2017. Network Cache Design under Stationary Requests: Challenges, Algorithms and Experiments. Arxiv preprint arXiv:1712.07307 (2017).

[29]

Nitish K. Panigrahy, Jian Li, Faheem Zafari, Don Towsley, and Paul Yu. 2017. What, When and Where to Cache: A Unified Optimization Approach. Arxiv preprint arXiv:1711.03941 (2017).

[30]

Alexander Schrijver. 2003. Combinatorial Optimization: Polyhedra and Efficiency. Vol. 24. Springer Science & Business Media.

[31]

Karthikeyan Shanmugam, Negin Golrezaei, Alexandros G Dimakis, Andreas F Molisch, and Giuseppe Caire. 2013. Femtocaching: Wireless Content Delivery through Distributed Caching Helpers. IEEE Transactions on Information Theory 59, 12 (2013), 8402--8413.

Digital Library

[32]

Dominic JA Welsh. 2010. Matroid Theory. Courier Corporation.

[33]

Mao Ye, Chengfa Li, Guihai Chen, and Jie Wu. 2005. EECS: an Energy Efficient Clustering Scheme in Wireless Sensor Networks. In IEEE IPCCC.

[34]

Wei Ye, John Heidemann, and Deborah Estrin. 2002. An Energy-Efficient MAC Protocol for Wireless Sensor Networks. In IEEE INFOCOM.

[35]

Yang Yu, Bhaskar Krishnamachari, and Viktor K Prasanna. 2008. Data Gathering with Tunable Compression in Sensor Networks. IEEE Transactions on Parallel and Distributed Systems 19, 2 (2008), 276--287.

Digital Library

[36]

Faheem Zafari, Jian Li, Kin K. Leung, Don Towsley, and Aanathram Swami. 2017. Optimal Energy Tradeoff among Communication, ation and Caching with QoI-Guarantee. Arxiv preprint arXiv:1712.03565

Cited By

Zafari FLi JLeung KTowsley DSwami A(2020)Optimal Energy Consumption for Communication, Computation, Caching, and Quality GuaranteeIEEE Transactions on Control of Network Systems10.1109/TCNS.2019.29135637:1(151-162)Online publication date: Mar-2020
https://doi.org/10.1109/TCNS.2019.2913563
Zalipynis R(2019)Evaluating Array DBMS Compression Techniques for Big Environmental Datasets2019 10th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications (IDAACS)10.1109/IDAACS.2019.8924326(859-863)Online publication date: 18-Sep-2019
https://dl.acm.org/doi/10.1109/IDAACS.2019.8924326
Zafari FLi JLeung KTowsley DSwami A(2018)Optimal Energy Tradeoff Among Communication, Computation and Caching with QoI-Guarantee2018 IEEE Global Communications Conference (GLOBECOM)10.1109/GLOCOM.2018.8647490(1-7)Online publication date: 9-Dec-2018
https://dl.acm.org/doi/10.1109/GLOCOM.2018.8647490

Index Terms

Joint Data Compression and Caching: Approaching Optimality with Guarantees
1. Networks
2. Theory of computation
  1. Design and analysis of algorithms
    1. Mathematical optimization

Recommendations

Selective Victim Caching: A Method to Improve the Performance of Direct-Mapped Caches

Although direct-mapped caches suffer from higher miss ratios as compared to set-associative caches, they are attractive for today's high-speed pipelined processors that require very low access times. Victim caching was proposed by Jouppi [1] as an ...
Quantitative Analysis on Caching Effect of I-Structure Data in Frame-Based Multithreaded Processing
ICPP '97: Proceedings of the international Conference on Parallel Processing

Since long latency due to remote memory access could be tolerated by rapidly switching to another thread in multithreaded processing, caching I-structure data is expected to have less beneficial effect on the performance than caching ordinary data. In ...
Novel Approaches for Integrating MART1 Clustering Based Pre-Fetching Technique with Web Caching

Web caching and Web pre-fetching are two important techniques for improving the performance of Web based information retrieval system. These two techniques would complement each other, since Web caching provides temporal locality whereas Web pre-...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

ICPE '18: Proceedings of the 2018 ACM/SPEC International Conference on Performance Engineering

March 2018

328 pages

ISBN:9781450350952

DOI:10.1145/3184407

General Chairs:
Katinka Wolter
Free University of Berlin, Germany
,
Will Knottenbelt
Imperial College London, UK
,
Program Chairs:
André van Hoorn
University of Stuttgart, Germany
,
Manoj Nambiar
Tata Consultancy Services, India
,
Heiko Koziolek
ABB, Germany

Copyright © 2018 ACM.

© 2018 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of the United States government. As such, the United States Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only.

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 30 March 2018

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

EPSRC Centre for Doctoral Training in High Performance Embedded and Distributed Systems
U.S. Army Research Laboratory and the U.K. Ministry of Defence

Conference

ICPE '18

Sponsor:

ICPE '18: ACM/SPEC International Conference on Performance Engineering

April 9 - 13, 2018

Berlin, Germany

Acceptance Rates

Overall Acceptance Rate 252 of 851 submissions, 30%

Upcoming Conference

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
144
Total Downloads

Downloads (Last 12 months)3
Downloads (Last 6 weeks)0

Reflects downloads up to 07 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Zafari FLi JLeung KTowsley DSwami A(2020)Optimal Energy Consumption for Communication, Computation, Caching, and Quality GuaranteeIEEE Transactions on Control of Network Systems10.1109/TCNS.2019.29135637:1(151-162)Online publication date: Mar-2020
https://doi.org/10.1109/TCNS.2019.2913563
Zalipynis R(2019)Evaluating Array DBMS Compression Techniques for Big Environmental Datasets2019 10th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications (IDAACS)10.1109/IDAACS.2019.8924326(859-863)Online publication date: 18-Sep-2019
https://dl.acm.org/doi/10.1109/IDAACS.2019.8924326
Zafari FLi JLeung KTowsley DSwami A(2018)Optimal Energy Tradeoff Among Communication, Computation and Caching with QoI-Guarantee2018 IEEE Global Communications Conference (GLOBECOM)10.1109/GLOCOM.2018.8647490(1-7)Online publication date: 9-Dec-2018
https://dl.acm.org/doi/10.1109/GLOCOM.2018.8647490

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten