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.
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01235800
Contributor : Mohamed Hamza Kaaouachi <>
Submitted on : Monday, November 30, 2015 - 4:44:27 PM
Last modification on : Thursday, March 21, 2019 - 1:08:32 PM

Links full text

Identifiers

Citation

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. IEEE, Parallel and Distributed Processing Symposium Workshop (IPDPSW), 2015 IEEE International, pp.483-489, 2015, 〈10.1109/IPDPSW.2015.59〉. 〈hal-01235800〉

Share

Metrics

Record views

239