On Using Matching Theory to Understand P2P Network Design

Dmitry Lebedev (1) , Fabien Mathieu (1) , Laurent Viennot (1) , Anh-Tuan Gai (1) , Julien Reynier (1, 2) , Fabien de Montgolfier (1)

1 GYROWEB - Dynamic graphs and the web graph
2 TREC - Theory of networks and communications

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.

Keywords: P2P networks; stable matchings; convergence properties

Domains: Computer Science and Game Theory [cs.GT]; Multiagent Systems [cs.MA]; Networking and Internet Architecture [cs.NI]

Dmitry Lebedev, Fabien Mathieu, Laurent Viennot, Anh-Tuan Gai, Julien Reynier, et al.. On Using Matching Theory to Understand P2P Network Design. [Research Report] RR-6075, INRIA. 2006, pp.7. ⟨inria-00121604v2⟩