Self-Stabilization in Preference-Based Networks

Fabien Mathieu 1, 2
2 GANG - Networks, Graphs and Algorithms
LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications, Inria Paris-Rocquencourt
Abstract : Participants in a decentralized system often use some local ranking information in selecting effective collaborations. We say that such systems are preference-based for most practical types of preferences, such systems converge towards a unique stable configuration. In this paper, we investigate the speed and quality of the convergence process with respect to the model parameters. Our results provide insight into the design of system parameters, such as the number of connections or the algorithm for choosing new partners.
Document type :
Conference papers
Liste complète des métadonnées

https://hal.inria.fr/hal-00668512
Contributor : Fabien Mathieu <>
Submitted on : Thursday, February 9, 2012 - 5:51:53 PM
Last modification on : Friday, January 4, 2019 - 5:33:21 PM

Identifiers

Collections

Citation

Fabien Mathieu. Self-Stabilization in Preference-Based Networks. P2P 2007 - Seventh IEEE International Conference on Peer-to-Peer Computing, Sep 2007, Galway, Ireland. pp.203 -210, ⟨10.1109/P2P.2007.16⟩. ⟨hal-00668512⟩

Share

Metrics

Record views

180