 |
|
|
|
| HAL : hal-00412063, version 1 |
| DOI : 10.1007/s00446-009-0089-1 |
| Fiche détaillée |  Récupérer au format |
|
|
| Distributed Computing 22, 2 (2009) 117-127 |
|
|
|
|
| The Cost of Monotonicity in Distributed Graph Searching |
|
|
| David Ilcinkas 1, 2Nicolas Nisse 3 |
|
|
| (2009) |
|
|
|
| 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. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | Laboratoire Bordelais de Recherche en Informatique (LaBRI) |
|
|
|
CNRS : UMR5800 – Université Sciences et Technologies - Bordeaux I – École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB) – Université Victor Segalen - Bordeaux II |
|
|
| 2 : | CEPAGE (INRIA Bordeaux - Sud-Ouest) |
|
|
|
INRIA – CNRS : UMR5800 – Université Sciences et Technologies - Bordeaux I – École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB) |
|
|
| 3 : | MASCOTTE (INRIA Sophia Antipolis / Laboratoire I3S) |
|
|
|
INRIA – Université de Nice Sophia Antipolis (UNS) – CNRS : UMR7271 |
|
|
| 4 : | Laboratoire de Recherche en Informatique (LRI) |
|
|
|
CNRS : UMR8623 – Université Paris XI - Paris Sud |
|
|
|
|
|
|
|
|
|
| Domaine | : | Informatique/Calcul parallèle, distribué et partagé |
|
|
| Graph searching – Mobile agent – Monotonicity – Competitive ratio |
|
|
|
| Liste des fichiers attachés à ce document : | |||||
|
|||||
|
|
|
| hal-00412063, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00412063 | |
| oai:hal.archives-ouvertes.fr:hal-00412063 | |
| Contributeur : David Ilcinkas | |
| Soumis le : Lundi 31 Août 2009, 16:08:06 | |
| Dernière modification le : Mercredi 7 Octobre 2009, 10:48:35 | |
