The Next 700 Impossibility Results in Time-Varying Graphs

Nicolas Braud-Santoni, Swan Dubois, Mohamed-Hamza Kaaouachi, Franck Petit

Research output: Contribution to journalArticle

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 conver-
gence. 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 struc-
ture on any TVG of this class. Namely, our impossibility results focus on the eventual footprint,
the minimal dominating set and the maximal matching problems.
Original languageEnglish
Article number1
Pages (from-to)27-41
JournalInternational Journal of Networking and Computing
Publication statusPublished - Jan 2016

Cite this