Acyclic Preference-Based Systems

Fabien Mathieu 1, 2
2 GANG - Networks, Graphs and Algorithms
LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications, Inria Paris-Rocquencourt
Abstract : Acyclic preference-based systems recently appeared as an elegant way to model many P2P unstructured or hybrid systems. The strength of these systems is a self-stabilizing property that allows to provide analytical results in addition to empirical validation. In this chapter, we give the keys to understand and use acyclic preference-based. After a brief introduction to the roots and notation of the model, the main convergence theorem is exposed and a description of P2P-relevant preferences is given. Ensues an explanation of the combinatory techniques used to refine the convergence study, and a statistical description, based on mean field assumptions, of the stable configurations of acyclic preference-based systems. For some preferences, we observe that the stable configuration is a small-world.
keyword : P2P Stable Marriages
Type de document :
Chapitre d'ouvrage
Shen, Xuemin and Yu, Heather and Buford, John and Akon, Mursalin. Handbook of Peer-to-Peer Networking, Springer US, pp.1165-1203, 2010, 978-0-387-09751-0. 〈10.1007/978-0-387-09751-0_42〉
Liste complète des métadonnées

https://hal.inria.fr/hal-00667351
Contributeur : Fabien Mathieu <>
Soumis le : mardi 7 février 2012 - 14:43:44
Dernière modification le : jeudi 11 janvier 2018 - 06:21:34

Identifiants

Collections

Citation

Fabien Mathieu. Acyclic Preference-Based Systems. Shen, Xuemin and Yu, Heather and Buford, John and Akon, Mursalin. Handbook of Peer-to-Peer Networking, Springer US, pp.1165-1203, 2010, 978-0-387-09751-0. 〈10.1007/978-0-387-09751-0_42〉. 〈hal-00667351〉

Partager

Métriques

Consultations de la notice

152