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

静态请求下的网络缓存设计:精确分析和Poisson近似

Network Cache Design under Stationary Requests: Exact Analysis and Poisson Approximation

Nitish K. Panigrahy, Jian Li, Don Towsley, Christopher V. Hollot

摘要:

最大化命中概率的缓存算法设计已得到广泛研究。在本文中,我们将每个内容与效用相关联,该效用是相应内容命中率或命中概率的函数。我们制定了一个缓存优化问题,以最大限度地提高在所有内容的平稳和遍历请求过程中的效用之和。这个问题一般是非凸的,但是当请求间时间(irt)分布具有非增风险率函数时,我们将其转化为凸优化问题。我们提供了一些irt分布的显式最优解,并比较了基于命中率(HRB)和基于命中概率(HPB)问题的解决方案。我们制定了一个逆向工程的基础上的双重实现的LRU下平稳到达。我们还提出了分散的算法,可以实现使用有限的信息,并使用离散时间李雅普诺夫技术(DTLT),以正确地表征其稳定性。我们发现,解决HRB的分散算法比分散HPB算法更强大。根据这些结果,我们进一步提出了轻量级泊松近似分散和在线算法,这些算法在实现最佳命中率和命中概率方面是准确和有效的。

英文摘要:

The design of caching algorithms to maximize hit probability has been extensively studied. In this paper, we associate each content with a utility, which is a function of either the corresponding content hit rate or hit probability. We formulate a cache optimization problem to maximize the sum of utilities over all contents under stationary and ergodic request processes. This problem is non-convex in general but we reformulate it as a convex optimization problem when the inter-request time (irt) distribution has a non-increasing hazard rate function. We provide explicit optimal solutions for some irt distributions, and compare the solutions of the hit-rate based (HRB) and hit-probability based (HPB) problems. We formulate a reverse engineering based dual implementation of LRU under stationary arrivals. We also propose decentralized algorithms that can be implemented using limited information and use a discrete time Lyapunov technique (DTLT) to correctly characterize their stability. We find that decentralized algorithms that solve HRB are more robust than decentralized HPB algorithms. Informed by these results, we further propose lightweight Poisson approximate decentralized and online algorithms that are accurate and efficient in achieving optimal hit rates and hit probabilities.

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

↑