A Generic Framework for Impossibility Results in Time-Varying Graphs - Archive ouverte HAL Access content directly
Conference Papers Year : 2015

A Generic Framework for Impossibility Results in Time-Varying Graphs

Abstract

We address highly dynamic distributed systems modelled by time-varying graphs (TVGs). We interest in proof of impossibility results that often use informal arguments about convergence. First, we provide a distance metric 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, \ie any TVG of the weakest class of long-lived TVGs.

Dates and versions

hal-01235800 , version 1 (30-11-2015)

Identifiers

Cite

Nicolas Braud-Santoni, Swan Dubois, Mohamed Hamza Kaaouachi, Franck Petit. A Generic Framework for Impossibility Results in Time-Varying Graphs. 17th Workshop on Advances on Parallel and Distributed Processing Symposium (APDCM'15), May 2015, Hyderabad, India. pp.483-489, ⟨10.1109/IPDPSW.2015.59⟩. ⟨hal-01235800⟩
119 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More