Brief Announcement: Analysis of a Memory-Efficient Self-stabilizing BFS Spanning Tree Construction - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2019

Brief Announcement: Analysis of a Memory-Efficient Self-stabilizing BFS Spanning Tree Construction

Ajoy K. Datta
  • Fonction : Auteur
  • PersonId : 830069
Stéphane Devismes
Lawrence Larmore
  • Fonction : Auteur
  • PersonId : 856333

Résumé

We present results on the last topic we collaborate with our late friend, Professor Ajoy Kumar Datta (1958-2019). In this work, we shed new light on a self-stabilizing wave algorithm proposed by Colette Johnen in 1997. This algorithm constructs a BFS spanning tree in any connected rooted network. Nowadays, it is still the best existing self-stabilizing BFS spanning tree construction in terms of memory requirement,(it only requires Θ(1) bits per edge). However, it has been proven assuming a weakly fair daemon. Moreover, its stabilization time was unknown. Here, we study the slightly modified version of this algorithm, still keeping the same memory requirement. We prove the self-stabilization of this variant under the distributed unfair daemon and show a stabilization time in O(D.n^2) rounds, where D is the network diameter and n the number of processes.

Dates et versions

hal-02489447 , version 1 (24-02-2020)

Identifiants

Citer

Ajoy K. Datta, Stéphane Devismes, Colette Johnen, Lawrence Larmore. Brief Announcement: Analysis of a Memory-Efficient Self-stabilizing BFS Spanning Tree Construction. 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2019), Oct 2019, Pise, Italy. pp.99-104, ⟨10.1007/978-3-030-34992-9_8⟩. ⟨hal-02489447⟩
50 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More