Edge networks are promising to provide better services to users by provisioning computing and storage resources at the edge of networks. However, due to the uncertainty and diversity of user interests, content popularity, distributed network structure, cache sizes, it is challenging to decide where to place the content, and how long it should be cached. In this paper, we study the utility optimization of content placement at edge networks through timer-based (TTL) policies. We propose provably optimal distributed algorithms that operate at each network cache to maximize the overall network utility. Our TTL-based optimization model provides theoretical answers to how long each content must be cached, and where it should be placed in the edge network. Extensive evaluations show that our algorithm significantly outperforms path replication with conventional caching algorithms over some network topologies.

中文翻译：

---

一种基于 TTL 的边缘网络内容放置方法

边缘网络有望通过在网络边缘提供计算和存储资源来为用户提供更好的服务。然而，由于用户兴趣、内容流行度、分布式网络结构、缓存大小的不确定性和多样性，决定内容的放置位置和缓存时间具有挑战性。在本文中，我们通过基于计时器 (TTL) 的策略研究了边缘网络内容放置的效用优化。我们提出了可证明的最优分布式算法，这些算法在每个网络缓存中运行，以最大化整体网络效用。我们基于 TTL 的优化模型为每个内容必须缓存多长时间以及它应该放置在边缘网络中的位置提供了理论答案。