The Next 700 Impossibility Results in Time-Varying Graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles International Journal of Networking and Computing Year : 2016

The Next 700 Impossibility Results in Time-Varying Graphs

Abstract

We consider highly dynamic distributed systems modelled by time-varying graphs (TVGs). We first address proof of impossibility results that often use informal arguments about convergence. We provide a general framework that formally proves the convergence of the sequence of executions of any deterministic algorithm over TVGs of any convergent sequence of TVGs. Next, we focus of the weakest class of long-lived TVGs, i.e., the class of TVGs where any node can communicate any other node infinitely often. We illustrate the relevance of our result by showing that no deterministic algorithm is able to compute various distributed covering structure on any TVG of this class. Namely, our impossibility results focus on the eventual footprint, the minimal dominating set and the maximal matching problems.
Fichier principal
Vignette du fichier
IJNC_HAL.pdf (497.4 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01344422 , version 1 (15-07-2016)

Identifiers

  • HAL Id : hal-01344422 , version 1

Cite

Nicolas Braud-Santoni, Swan Dubois, Mohamed Hamza Kaaouachi, Franck Petit. The Next 700 Impossibility Results in Time-Varying Graphs. International Journal of Networking and Computing, 2016, 6 (1), pp.27-41. ⟨hal-01344422⟩
221 View
80 Download

Share

Gmail Facebook Twitter LinkedIn More