The Cost of Monotonicity in Distributed Graph Searching

David Ilcinkas 1, 2 Nicolas Nisse 3 David Soguet 4
2 CEPAGE - Algorithmics for computationally intensive applications over wide scale distributed platforms
Université Sciences et Technologies - Bordeaux 1, Inria Bordeaux - Sud-Ouest, École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), CNRS - Centre National de la Recherche Scientifique : UMR5800
3 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : Blin et al. (TCS 2008) proposed a distributed protocol enabling the smallest possible number of searchers to clear any unknown graph in a decentralized manner. However, the strategy that is actually performed lacks of an important property, namely the monotonicity. This paper deals with the smallest number of searchers that are necessary and sufficient to monotonously clear any unknown graph in a decentralized manner. The clearing of the graph is required to be connected, i.e., the clear part of the graph must remain permanently connected, and monotone, i.e., the clear part of the graph only grows. We prove that a distributed protocol clearing any unknown $n$-node graph in a monotone connected way, in a decentralized setting, can achieve but cannot beat competitive ratio of $\Theta(\frac{n}{\log n})$, compared with the centralized minimum number of searchers. Moreover, our lower bound holds even in a synchronous setting, while our constructive upper bound holds even in an asynchronous setting.
Type de document :
Article dans une revue
Distributed Computing, Springer Verlag, 2009, 22 (2), pp.117-127. 〈10.1007/s00446-009-0089-1〉
Liste complète des métadonnées

Littérature citée [18 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-00412063
Contributeur : David Ilcinkas <>
Soumis le : lundi 31 août 2009 - 16:08:06
Dernière modification le : mercredi 4 janvier 2017 - 16:21:48
Document(s) archivé(s) le : mardi 15 juin 2010 - 22:59:03

Fichier

rerevised_DisComp.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

David Ilcinkas, Nicolas Nisse, David Soguet. The Cost of Monotonicity in Distributed Graph Searching. Distributed Computing, Springer Verlag, 2009, 22 (2), pp.117-127. 〈10.1007/s00446-009-0089-1〉. 〈hal-00412063〉

Partager

Métriques

Consultations de
la notice

281

Téléchargements du document

115