The Next 700 Impossibility Results in Time-Varying Graphs

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

Research output: Contribution to journalArticleResearchpeer-review

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

Braud-Santoni, N., Dubois, S., Kaaouachi, M-H., & Petit, F. (2016). The Next 700 Impossibility Results in Time-Varying Graphs. International Journal of Networking and Computing, 27-41. [1].

The Next 700 Impossibility Results in Time-Varying Graphs. / Braud-Santoni, Nicolas; Dubois, Swan; Kaaouachi, Mohamed-Hamza; Petit, Franck.

In: International Journal of Networking and Computing, 01.2016, p. 27-41.

Research output: Contribution to journalArticleResearchpeer-review

Braud-Santoni, N, Dubois, S, Kaaouachi, M-H & Petit, F 2016, 'The Next 700 Impossibility Results in Time-Varying Graphs' International Journal of Networking and Computing, pp. 27-41.
Braud-Santoni N, Dubois S, Kaaouachi M-H, Petit F. The Next 700 Impossibility Results in Time-Varying Graphs. International Journal of Networking and Computing. 2016 Jan;27-41. 1.
Braud-Santoni, Nicolas ; Dubois, Swan ; Kaaouachi, Mohamed-Hamza ; Petit, Franck. / The Next 700 Impossibility Results in Time-Varying Graphs. In: International Journal of Networking and Computing. 2016 ; pp. 27-41.
@article{89f9d4ebdc454a8b90453f24d96cb2a0,
title = "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 conver-gence. We provide a general framework that formally proves the convergence of the sequenceof 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 nodecan communicate any other node infinitely often. We illustrate the relevance of our result byshowing 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.",
author = "Nicolas Braud-Santoni and Swan Dubois and Mohamed-Hamza Kaaouachi and Franck Petit",
year = "2016",
month = "1",
language = "English",
pages = "27--41",
journal = "International Journal of Networking and Computing",
issn = "2185-2847",
publisher = "J-STAGE",

}

TY - JOUR

T1 - The Next 700 Impossibility Results in Time-Varying Graphs

AU - Braud-Santoni, Nicolas

AU - Dubois, Swan

AU - Kaaouachi, Mohamed-Hamza

AU - Petit, Franck

PY - 2016/1

Y1 - 2016/1

N2 - 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 sequenceof 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 nodecan communicate any other node infinitely often. We illustrate the relevance of our result byshowing 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.

AB - 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 sequenceof 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 nodecan communicate any other node infinitely often. We illustrate the relevance of our result byshowing 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.

UR - http://www.ijnc.org/index.php/ijnc/article/view/116

M3 - Article

SP - 27

EP - 41

JO - International Journal of Networking and Computing

JF - International Journal of Networking and Computing

SN - 2185-2847

M1 - 1

ER -