论对等系统中的民主
On Democracy in Peer-to-Peer systems
摘要：
P2P网络中的信息流高度依赖于网络结构。为了简化相关数据向感兴趣的对等体的扩散，许多P2P协议通过将相似的节点置于直接联系中来收集它们。通过这种方法，节点之间的相似性是以点对点的方式计算的：每个对等体单独识别与它共享相似兴趣的节点。这导致了一种“私人”社区的创建，仅限于每个对等体的邻居列表。这种“私人”知识不允许识别发现和表征在更广泛的组中收集类似对等体的相关性所需的特征。为了让这些相关性出现，必须利用同行的集体知识。一个共同的问题，以克服，以避免网络的“私人”的愿景，是如何分布式确定社区的代表性，以及如何节点可能会决定属于it.We建议使用一个八卦样的方法，以让同行选举和识别领导人的利益社区。一旦选出领导人，他们的个人资料就被用作社区代表。同伴们通过选择他们所知道的最相似的代表来决定是否加入一个社区。
英文摘要：
The information flow inside a P2P network is highly dependent on the network structure. In order to ease the diffusion of relevant data toward interested peers, many P2P protocols gather similar nodes by putting them in direct contact. With this approach the similarity between nodes is computed in a point-to-point fashion: each peer individually identifies the nodes that share similar interests with it. This leads to the creation of a sort of "private" communities, limited to each peer neighbors list. This "private" knowledge do not allow to identify the features needed to discover and characterize the correlations that collect similar peers in broader groups. In order to let these correlations to emerge, the collective knowledge of peers must be exploited. One common problem to overcome in order to avoid the "private" vision of the network, is related to how distributively determine the representation of a community and how nodes may decide to belong to it. We propose to use a gossip-like approach in order to let peers elect and identify leaders of interest communities. Once leaders are elected, their profiles are used as community representatives. Peers decide to adhere to a community or another by choosing the most similar representative they know about.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
