Upper bounds for stabilization in acyclic preference-based systems

Fabien Mathieu 1, 2
2 GANG - Networks, Graphs and Algorithms
LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications, Inria Paris-Rocquencourt
Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [12 references]  Display  Hide  Download

https://hal.inria.fr/hal-00668356
Contributor : Fabien Mathieu <>
Submitted on : Thursday, February 9, 2012 - 4:29:11 PM
Last modification on : Friday, January 4, 2019 - 5:33:21 PM
Long-term archiving on : Thursday, May 10, 2012 - 2:50:43 AM

File

10.1.1.95.9032.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-00668356, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

287

Files downloads

253