On Using Matching Theory to Understand P2P Network Design - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2006

On Using Matching Theory to Understand P2P Network Design


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.
Fichier principal
Vignette du fichier
RR-6075.pdf (114.36 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00121604 , version 1 (21-12-2006)
inria-00121604 , version 2 (22-12-2006)



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⟩
200 View
187 Download



Gmail Facebook Twitter LinkedIn More