The Stable Configuration of Acyclic Preference-Based Systems

Fabien Mathieu 1, 2 Gheorghe Postelnicu 3 Julien Reynier 4
2 GANG - Networks, Graphs and Algorithms
LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications, Inria Paris-Rocquencourt
Abstract : Acyclic preferences recently appeared as an elegant way to model many distributed systems. An acyclic instance admits a unique stable configuration, which can reveal the performance of the system. In this paper, we give the statistical properties of the stable configuration for three classes of acyclic preferences: node-based preferences, distance-based preferences, and random acyclic systems. Using random overlay graphs, we prove by means of a mean-field assumption and a fluid-limit technique that these systems have an asymptotically continuous independent rank distribution for a proper scaling, and the analytical solution is compared to simulations. These results provide a theoretical ground for validating the performance of bandwidth-based or proximity-based unstructured systems.
Document type :
Conference papers
Complete list of metadatas

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

Identifiers

Collections

Citation

Fabien Mathieu, Gheorghe Postelnicu, Julien Reynier. The Stable Configuration of Acyclic Preference-Based Systems. INFOCOM 2009, Apr 2009, Rio de Janeiro, Brazil. pp.1440-1448, ⟨10.1109/INFCOM.2009.5062060⟩. ⟨hal-00668292⟩

Share

Metrics

Record views

299