The Stable Configuration of Acyclic Preference-Based Systems - Archive ouverte HAL Access content directly
Conference Papers Year : 2009

The Stable Configuration of Acyclic Preference-Based Systems

(1, 2) , (3) , (4)
1
2
3
4

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.

Dates and versions

hal-00668292 , version 1 (09-02-2012)

Identifiers

Cite

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⟩
177 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More