DocumentCode :
3664206
Title :
A Generic Framework for Impossibility Results in Time-Varying Graphs
Author :
Nicolas Braud-Santoni;Swan Dubois;Mohamed-Hamza Kaaouachi;Franck Petit
Author_Institution :
IAIK, Graz Univ. of Technol., Graz, Austria
fYear :
2015
fDate :
5/1/2015 12:00:00 AM
Firstpage :
483
Lastpage :
489
Abstract :
We address highly dynamic distributed systems modelled by time-varying graphs (TVGs). We are interested in proof of impossibility results that often use informal arguments about convergence. First, we provide a topological distance metric over sets of TVGs to correctly define the convergence of TVG sequences in such sets. 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.
Keywords :
"Convergence","Topology","Computational modeling","Delays","Electronic mail","Heuristic algorithms"
Publisher :
ieee
Conference_Titel :
Parallel and Distributed Processing Symposium Workshop (IPDPSW), 2015 IEEE International
Type :
conf
DOI :
10.1109/IPDPSW.2015.59
Filename :
7284347
Link To Document :
بازگشت