The Cost of Monotonicity in Distributed Graph Searching - Archive ouverte HAL Access content directly
Journal Articles Distributed Computing Year : 2009

The Cost of Monotonicity in Distributed Graph Searching

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.
Fichier principal
Vignette du fichier
rerevised_DisComp.pdf (175.64 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00412063 , version 1 (31-08-2009)

Identifiers

Cite

David Ilcinkas, Nicolas Nisse, David Soguet. The Cost of Monotonicity in Distributed Graph Searching. Distributed Computing, 2009, 22 (2), pp.117-127. ⟨10.1007/s00446-009-0089-1⟩. ⟨hal-00412063⟩
240 View
119 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More