无线网络中联合内容复制和分发的渐近规律
Asymptotic Laws for Joint Content Replication and Delivery in Wireless Networks
摘要：
我们调查的可扩展性的多跳无线通信，在网络中的一个主要问题，用户访问的情况下，跨节点复制的内容。与随机选择通信对的标准范例相反，内容复制对于文件流行度、高速缓存和网络大小的某些制度是有效的。我们的研究开始于详细的联合内容复制和交付问题的二维正方形网格，一个硬组合优化。这被简化为基于复制密度的更简单的问题，其性能与原始的相同。假设Zipf流行率定律，并让内容和网络的大小都趋于无穷大，我们确定所需的链路容量的缩放定律和制度，范围从O（\sqrt{N}）到O（1）。
英文摘要：
We investigate on the scalability of multihop wireless communications, a major concern in networking, for the case that users access content replicated across the nodes. In contrast to the standard paradigm of randomly selected communicating pairs, content replication is efficient for certain regimes of file popularity, cache and network size. Our study begins with the detailed joint content replication and delivery problem on a 2D square grid, a hard combinatorial optimization. This is reduced to a simpler problem based on replication density, whose performance is of the same order as the original. Assuming a Zipf popularity law, and letting the size of content and network both go to infinity, we identify the scaling laws and regimes of the required link capacity, ranging from O(\sqrt{N}) down to O(1).
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
