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.
Complete list of metadatas

Cited literature [12 references]  Display  Hide  Download

https://hal.inria.fr/hal-01344422
Contributor : Swan Dubois <>
Submitted on : Friday, July 15, 2016 - 9:31:26 AM
Last modification on : Wednesday, July 10, 2019 - 9:54:29 AM
Long-term archiving on : Sunday, October 16, 2016 - 10:30:15 AM

File

IJNC_HAL.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01344422, version 1

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⟩

Share

Metrics

Record views

354

Files downloads

148