A Self-Stabilizing Memory Efficient Algorithm for the Minimum Diameter Spanning Tree under an Omnipotent Daemon

Lélia Blin 1, 2 Fadwa Boubekeur 1 Swan Dubois 3
1 NPA - Networks and Performance Analysis
LIP6 - Laboratoire d'Informatique de Paris 6
3 Regal - Large-Scale Distributed Systems and Applications
LIP6 - Laboratoire d'Informatique de Paris 6, Inria Paris-Rocquencourt
Abstract : The diameter of a network is one of the most fundamental network parameters. Being able to compute the diameter is an important problem in the analysis of large networks, and moreover this parameter has many important practical applications in real networks. As a consequence, it is natural to study this problem in a distributed system, and more specifically in a distributed system tolerant to transient faults. More specifically, we are interested in the problem to identify one of the centers of graph. Once done, we construct a minimum diameter spanning tree rooted in this centre. Of course, the challenging problem is to compute one centre of the graph. We present a uniform self-stabilizing algorithm for the minimum diameter spanning tree construction problem in the state model. Our protocol has several attractive features that makes it suitable for practical purposes. It is the first algorithm for this problem that operates under the unfair adversary (also called unfair daemon). In other words, no restriction is made on the distributed behaviour of the system. Consequently, it is the hardest adversary to deal with. Moreover, our algorithm needs only O(log n) bits of memory per process (where n is the number of processes), that improves the previous result by a factor n. These improvements are not achieved to the detriment of the convergence time, that stays reasonable with O(n2) rounds.
Document type :
Conference papers
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01201859
Contributor : Lip6 Publications <>
Submitted on : Friday, September 18, 2015 - 11:26:10 AM
Last modification on : Thursday, March 21, 2019 - 2:16:51 PM

Identifiers

Citation

Lélia Blin, Fadwa Boubekeur, Swan Dubois. A Self-Stabilizing Memory Efficient Algorithm for the Minimum Diameter Spanning Tree under an Omnipotent Daemon. 29rd IEEE International Symposium on Parallel and Distributed Processing (IPDPS 2015), May 2015, Hyberabad, India. pp.1065-1074, ⟨10.1109/IPDPS.2015.44⟩. ⟨hal-01201859⟩

Share

Metrics

Record views

223