Skip to main content
Journal Article

Random distributed self-stabilizing structures maintenance

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2004) 3061 231-240
DOI: 10.1007/978-3-540-25958-9_21
8Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Self-stabilization is a solution for many fault-tolerance problems. In this paper, we present a self-stabilizing solution to compute random local spanning trees rooted in each site. The computation is achieved thanks to random walks. We present an algorithm that works in a fully distributed environment: asynchronous message passing model is used. © Springe-Verlag 2004.

Author supplied keywords

Cite

CITATION STYLE

APA

Bernard, T., Bui, A., & Flauzac, O. (2004). Random distributed self-stabilizing structures maintenance. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3061, 231–240. https://doi.org/10.1007/978-3-540-25958-9_21

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free