Peer-to-Peer系统中的核心持久性：大小与生命周期的关系
Core Persistence in Peer-to-Peer Systems: Relating Size to Lifetime
摘要：
分布式系统现在既非常庞大又高度动态。对等覆盖网络已被证明是有效的，以应付这一新的交易，传统的方法不能再容纳。虽然在覆盖网络中组织对等点的挑战已经产生了很多兴趣，导致了大量的解决方案，但在这样的网络中维护关键数据仍然是一个悬而未决的问题。在本文中，我们感兴趣的是定义的节点和频率的一部分，以探测，在系统中观察到的流失，以实现一个给定的概率保持持久性的一些关键数据。更具体地说，我们提供了一个明确的结果，涉及的大小和频率的探测集，以及它的证明，以及分析的方式，利用这样的信息在一个大规模的动态分布式系统。
英文摘要：
Distributed systems are now both very large and highly dynamic. Peer to peer overlay networks have been proved efficient to cope with this new deal that traditional approaches can no longer accommodate. While the challenge of organizing peers in an overlay network has generated a lot of interest leading to a large number of solutions, maintaining critical data in such a network remains an open issue. In this paper, we are interested in defining the portion of nodes and frequency one has to probe, given the churn observed in the system, in order to achieve a given probability of maintaining the persistence of some critical data. More specifically, we provide a clear result relating the size and the frequency of the probing set along with its proof as well as an analysis of the way of leveraging such an information in a large scale dynamic distributed system.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
