P2P网络中的非循环偏好系统
Acyclic Preference Systems in P2P Networks
摘要:
在这项工作中,我们研究自然的对等范式的偏好系统。其中大多数可分为三类:全球性、对称性和互补性。所有这些系统都具有非循环性。因此,他们承认一个稳定的(或帕累托有效的)配置,其中没有参与者可以与比他们目前的更好的合作伙伴进行合作。我们分析了这种偏好系统的表示,并表明任何非循环系统可以表示与对称的标记矩阵。这就给出了一种合并非循环偏好系统并保持其非循环性的方法。我们还考虑了相应的合作图的性质,如聚类系数和直径。特别是,研究基于真实延迟测量的偏好的例子,我们观察到其稳定配置是一个小世界图。
英文摘要:
In this work we study preference systems natural for the Peer-to-Peer paradigm. Most of them fall in three categories: global, symmetric and complementary. All these systems share an acyclicity property. As a consequence, they admit a stable (or Pareto efficient) configuration, where no participant can collaborate with better partners than their current ones. We analyze the representation of the such preference systems and show that any acyclic system can be represented with a symmetric mark matrix. This gives a method to merge acyclic preference systems and retain the acyclicity. We also consider such properties of the corresponding collaboration graph, as clustering coefficient and diameter. In particular, studying the example of preferences based on real latency measurements, we observe that its stable configuration is a small-world graph.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。