移动网络中轻量级分布式内容复制解决方案
A Lightweight Distributed Solution to Content Replication in Mobile Networks
摘要：
移动网络中内容访问的性能和可靠性取决于部署在网络节点处的内容副本的数量和位置。设施定位理论一直是传统的，集中的方法来研究内容复制：计算网络中的副本的数量和位置可以被视为一个无容量限制的设施定位问题。这项工作的努力是设计一个分布式的，轻量级的解决方案，上述联合优化问题，同时考虑到网络动态。特别是，我们设计了一种机制，让节点分担存储和提供内容的负担，从而实现负载均衡，并决定是否复制或丢弃的信息，以适应动态的内容需求和时变的拓扑结构。我们评估我们的机制，通过模拟，通过探索广泛的设置和研究现实的内容访问机制，超越了传统的proptionmatching需求点，他们最接近的内容副本。结果表明，我们的机制，它只使用本地测量，是：（i）非常精确的近似的最佳解决方案的内容放置和复制;（ii）对网络移动性的鲁棒性;（iii）灵活地适应各种内容访问模式，包括变化的时间和空间的内容需求。
英文摘要：
Performance and reliability of content access in mobile networks is conditioned by the number and location of content replicas deployed at the network nodes. Facility location theory has been the traditional, centralized approach to study content replication: computing the number and placement of replicas in a network can be cast as an uncapacitated facility location problem. The endeavour of this work is to design a distributed, lightweight solution to the above joint optimization problem, while taking into account the network dynamics. In particular, we devise a mechanism that lets nodes share the burden of storing and providing content, so as to achieve load balancing, and decide whether to replicate or drop the information so as to adapt to a dynamic content demand and time-varying topology. We evaluate our mechanism through simulation, by exploring a wide range of settings and studying realistic content access mechanisms that go beyond the traditional assumptionmatching demand points to their closest content replica. Results show that our mechanism, which uses local measurements only, is: (i) extremely precise in approximating an optimal solution to content placement and replication; (ii) robust against network mobility; (iii) flexible in accommodating various content access patterns, including variation in time and space of the content demand.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
