arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv cs/0612108cs.NIcs.GT
收藏

用匹配理论理解P2P网络设计

On Using Matching Theory to Understand P2P Network Design

Dmitry Lebedev, Fabien Mathieu, Laurent Viennot, Anh-Tuan Gai, Julien Reynier, Fabien De Montgolfier

摘要:

本文旨在提供洞察P2P网络中的协作选择的稳定性。我们研究的网络中,节点之间的交流是由希望获得最好的服务。大多数现有P2P网络都是这种情况。我们探讨了一个进化模型来自稳定的室友理论,占节点之间的异质性。我们表明,大多数P2P应用程序可以使用稳定的匹配理论建模。每当可以从交换政策中推导出偏好列表时,情况就是如此。在许多情况下,首选项列表的特征在于一个有趣的非循环属性。我们证明了具有非循环偏好的P2P网络具有唯一的稳态,并具有良好的收敛特性。

英文摘要:

This paper aims to provide insight into stability of collaboration choices in P2P networks. We study networks where exchanges between nodes are driven by the desire to receive the best service available. This is the case for most existing P2P networks. We explore an evolution model derived from stable roommates theory that accounts for heterogeneity between nodes. We show that most P2P applications can be modeled using stable matching theory. This is the case whenever preference lists can be deduced from the exchange policy. In many cases, the preferences lists are characterized by an interesting acyclic property. We show that P2P networks with acyclic preferences possess a unique stable state with good convergence properties.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑