Skip to Main content Skip to Navigation
Reports

Acyclic Preference Systems in P2P Networks

Abstract : 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.
Complete list of metadatas

Cited literature [1 references]  Display  Hide  Download

https://hal.inria.fr/inria-00143790
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 2, 2007 - 3:06:03 PM
Last modification on : Tuesday, September 22, 2020 - 3:53:32 AM
Long-term archiving on: : Tuesday, September 21, 2010 - 1:06:31 PM

Files

RR-6174.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00143790, version 2
  • ARXIV : 0704.3904

Collections

Citation

Anh-Tuan Gai, Dmitry Lebedev, Fabien Mathieu, Fabien de Montgolfier, Julien Reynier, et al.. Acyclic Preference Systems in P2P Networks. [Research Report] RR-6174, INRIA. 2007, pp.9. ⟨inria-00143790v2⟩

Share

Metrics

Record views

444

Files downloads

482