The Next 700 Impossibility Results in Time-Varying Graphs

Abstract : We address highly dynamic distributed systems modeled by time-varying graphs (TVGs). We interest in proof of impossibility results that often use informal arguments about convergence. First, we provide a distance among TVGs to define correctly the convergence of TVG sequences. Next, 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. Finally, we illustrate the relevance of the above result by proving that no deterministic algorithm exists to compute the underlying graph of any connected-over-time TVG, i.e., any TVG of the weakest class of long-lived TVGs.
Complete list of metadatas

https://hal.inria.fr/hal-01097109
Contributor : Swan Dubois <>
Submitted on : Thursday, December 18, 2014 - 7:43:05 PM
Last modification on : Thursday, March 21, 2019 - 1:09:30 PM
Long-term archiving on : Monday, March 23, 2015 - 5:28:55 PM

Files

IPL.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01097109, version 1
  • ARXIV : 1412.6007

Citation

Nicolas Braud-Santoni, Swan Dubois, Mohamed Hamza Kaaouachi, Franck Petit. The Next 700 Impossibility Results in Time-Varying Graphs. [Research Report] UPMC Sorbonne Universités/CNRS/Inria - EPI REGAL. 2014. ⟨hal-01097109⟩

Share

Metrics

Record views

512

Files downloads

221