A Generic Framework for Impossibility Results in Time-Varying Graphs

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

Publikation: Beitrag in Buch/Bericht/KonferenzbandBeitrag in einem KonferenzbandForschungBegutachtung

Abstract

We address highly dynamic distributed systems
modeled 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.
Originalspracheenglisch
TitelIEEE International Symposium on Parallel & Distributed Processing, Workshops
Herausgeber (Verlag)IEEE Conference Publishing
Seiten0-0
PublikationsstatusVeröffentlicht - 2015
VeranstaltungIEEE International Parallel & Distributed Processing Symposium - Hyderabad, Indien
Dauer: 25 Mai 201525 Mai 2015

Konferenz

KonferenzIEEE International Parallel & Distributed Processing Symposium
LandIndien
OrtHyderabad
Zeitraum25/05/1525/05/15

    Fingerprint

Fields of Expertise

  • Information, Communication & Computing

Treatment code (Nähere Zuordnung)

  • Theoretical

Dieses zitieren

Braud-Santoni, N., Dubois, S., Kaaouachi, M-H., & Petit, F. (2015). A Generic Framework for Impossibility Results in Time-Varying Graphs. in IEEE International Symposium on Parallel & Distributed Processing, Workshops (S. 0-0). IEEE Conference Publishing.