Communication Dans Un Congrès Année : 2007

Upper bounds for stabilization in acyclic preference-based systems

Résumé

Preference-based systems (p.b.s.) describe interactions between nodes of a system that can rank their neighbors. Previous work has shown that p.b.s. converge to a unique locally stable matching if an acyclicity property is verified. In the following we analyze acyclic p.b.s. with respect to the self-stabilization theory. We prove that the round complexity is bounded by n/2 for the adversarial daemon. The step complexity is equivalent to (n^2)/4 for the round robin daemon, and exponential for the general adversarial daemon.

Fichier principal
Vignette du fichier
10.1.1.95.9032.pdf (396.1 Ko) Télécharger le fichier
Origine Fichiers éditeurs autorisés sur une archive ouverte
Licence
Loading...

Dates et versions

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

Licence

Identifiants

  • HAL Id : hal-00668356 , version 1

Citer

Fabien Mathieu. Upper bounds for stabilization in acyclic preference-based systems. SSS'07 - 9th international conference on Stabilization, Safety, and Security of Distributed Systems, 2007, Paris, France. pp.372--382. ⟨hal-00668356⟩
201 Consultations
308 Téléchargements

Partager

  • More