The stable configuration in acyclic preference-based systems

Simple item page
dc.creatorMathieu, Fabien
dc.creatorPostelnicu, Gheorghe
dc.creatorReynier, Julien
dc.date2008-09-04
dc.date.accessioned2026-07-07T10:00:42Z
dc.date.available2026-07-07T10:00:42Z
dc.descriptionAcyclic 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 using mean-field and fluid-limit techniques 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.
dc.identifierhttps://arxiv.org/abs/0809.0833
dc.identifierhttp://arxiv.org/abs/0809.0833
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/168397
dc.subjectNetworking and Internet Architecture
dc.titleThe stable configuration in acyclic preference-based systems
dc.typetext

Files

Collections

arXiv