arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1801.02099cs.NIcs.PF
收藏

联合数据压缩和高速缓存:保证最优性

Joint Data Compression and Caching: Approaching Optimality with Guarantees

Jian Li, Faheem Zafari, Don Towsley, Kin K. Leung, Ananthram Swami

摘要:

我们考虑的问题,最佳压缩和缓存数据在通信网络。给定在边缘节点和路由路径处生成的数据,我们的目标是确定最佳的数据压缩比率和整个网络的缓存决策,以最小化平均延迟,这可以被证明相当于在能量消耗约束下最大化压缩和缓存增益。我们表明,这个问题是NP-困难的一般和硬度是由缓存决策子问题,而压缩子问题是多项式时间可解的。然后,我们提出了一个近似算法,实现了$(1-1/e)$近似解决方案的最佳强多项式时间。我们表明,我们提出的算法实现了近最佳的性能,在综合为基础的评价。在本文中,我们考虑一个树结构的网络作为一个说明性的例子,但我们的结果很容易扩展到一般的网络拓扑结构,在更复杂的符号为代价。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑