Acyclic Preference Systems in P2P Networks

Abstract : In this work we study preference systems suitable for the Peer-to-Peer paradigm. Most of them fall in one of the three following 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 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 while retaining the acyclicity property. We also consider properties of the corresponding collaboration graph, such as clustering coefficient and diameter. In particular, the study of the example of preferences based on real latency measurements shows that its stable configuration is a small-world graph.
Type de document :
Communication dans un congrès
Anne-Marie Kermarrec and Luc Bougé and Thierry Priol. Proceedings of the 13th International Euro-Par Conference - Euro-Par 2007, Aug 2007, Rennes, France. Springer, 4641, pp.825-834, 2007, Lecture Notes in Computer Science. 〈10.1007/978-3-540-74466-5_88〉
Liste complète des métadonnées

Littérature citée [15 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00471720
Contributeur : Laurent Viennot <>
Soumis le : jeudi 8 avril 2010 - 17:53:04
Dernière modification le : mardi 17 avril 2018 - 11:29:37
Document(s) archivé(s) le : vendredi 9 juillet 2010 - 21:21:36

Fichier

europar07.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Anh-Tuan Gai, Dmitry Lebedev, Fabien Mathieu, Fabien De Montgolfier, Julien Reynier, et al.. Acyclic Preference Systems in P2P Networks. Anne-Marie Kermarrec and Luc Bougé and Thierry Priol. Proceedings of the 13th International Euro-Par Conference - Euro-Par 2007, Aug 2007, Rennes, France. Springer, 4641, pp.825-834, 2007, Lecture Notes in Computer Science. 〈10.1007/978-3-540-74466-5_88〉. 〈inria-00471720〉

Partager

Métriques

Consultations de la notice

400

Téléchargements de fichiers

132