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.
Type de document :
Article dans une revue
International Journal of Networking and Computing, Higashi Hiroshima : Dept. of Computer Engineering, Hiroshima University, 2016, 6 (1), pp.27-41
Liste complète des métadonnées

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

https://hal.inria.fr/hal-01344422
Contributeur : Swan Dubois <>
Soumis le : vendredi 15 juillet 2016 - 09:31:26
Dernière modification le : mercredi 21 mars 2018 - 18:58:22
Document(s) archivé(s) le : dimanche 16 octobre 2016 - 10:30:15

Fichier

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

Identifiants

  • HAL Id : hal-01344422, version 1

Collections

Citation

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, Higashi Hiroshima : Dept. of Computer Engineering, Hiroshima University, 2016, 6 (1), pp.27-41. 〈hal-01344422〉

Partager

Métriques

Consultations de la notice

281

Téléchargements de fichiers

37