A Generic Framework for Impossibility Results in Time-Varying Graphs

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

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.
Original languageEnglish
Title of host publicationIEEE International Symposium on Parallel & Distributed Processing, Workshops
PublisherIEEE Conference Publishing
Pages0-0
Publication statusPublished - 2015
EventIEEE International Parallel & Distributed Processing Symposium - Hyderabad, India
Duration: 25 May 201525 May 2015

Conference

ConferenceIEEE International Parallel & Distributed Processing Symposium
CountryIndia
CityHyderabad
Period25/05/1525/05/15

Fingerprint

Time-varying
Graph in graph theory
Deterministic Algorithm
Framework

Fields of Expertise

  • Information, Communication & Computing

Treatment code (Nähere Zuordnung)

  • Theoretical

Cite this

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 (pp. 0-0). IEEE Conference Publishing.

A Generic Framework for Impossibility Results in Time-Varying Graphs. / Braud-Santoni, Nicolas; Dubois, Swan; Kaaouachi, Mohamed-Hamza; Petit, Franck.

IEEE International Symposium on Parallel & Distributed Processing, Workshops. IEEE Conference Publishing, 2015. p. 0-0.

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

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. IEEE Conference Publishing, pp. 0-0, IEEE International Parallel & Distributed Processing Symposium, Hyderabad, India, 25/05/15.
Braud-Santoni N, Dubois S, Kaaouachi M-H, Petit F. A Generic Framework for Impossibility Results in Time-Varying Graphs. In IEEE International Symposium on Parallel & Distributed Processing, Workshops. IEEE Conference Publishing. 2015. p. 0-0
Braud-Santoni, Nicolas ; Dubois, Swan ; Kaaouachi, Mohamed-Hamza ; Petit, Franck. / A Generic Framework for Impossibility Results in Time-Varying Graphs. IEEE International Symposium on Parallel & Distributed Processing, Workshops. IEEE Conference Publishing, 2015. pp. 0-0
@inproceedings{2d9c0fe1d0c24f079bafaf63b11ece68,
title = "A Generic Framework for Impossibility Results in Time-Varying Graphs",
abstract = "We address highly dynamic distributed systemsmodeled by time-varying graphs (TVGs). We are interested inproof of impossibility results that often use informal argumentsabout convergence. First, we provide a topological distance metricover sets of TVGs to correctly define the convergence of TVGsequences in such sets. Next, we provide a general framework thatformally proves the convergence of the sequence of executionsof any deterministic algorithm over TVGs of any convergentsequence of TVGs. Finally, we illustrate the relevance of theabove result by proving that no deterministic algorithm exists tocompute the underlying graph of any connected-over-time TVG,i.e., any TVG of the weakest class of long-lived TVGs.",
author = "Nicolas Braud-Santoni and Swan Dubois and Mohamed-Hamza Kaaouachi and Franck Petit",
year = "2015",
language = "English",
pages = "0--0",
booktitle = "IEEE International Symposium on Parallel & Distributed Processing, Workshops",
publisher = "IEEE Conference Publishing",

}

TY - GEN

T1 - A Generic Framework for Impossibility Results in Time-Varying Graphs

AU - Braud-Santoni, Nicolas

AU - Dubois, Swan

AU - Kaaouachi, Mohamed-Hamza

AU - Petit, Franck

PY - 2015

Y1 - 2015

N2 - We address highly dynamic distributed systemsmodeled by time-varying graphs (TVGs). We are interested inproof of impossibility results that often use informal argumentsabout convergence. First, we provide a topological distance metricover sets of TVGs to correctly define the convergence of TVGsequences in such sets. Next, we provide a general framework thatformally proves the convergence of the sequence of executionsof any deterministic algorithm over TVGs of any convergentsequence of TVGs. Finally, we illustrate the relevance of theabove result by proving that no deterministic algorithm exists tocompute the underlying graph of any connected-over-time TVG,i.e., any TVG of the weakest class of long-lived TVGs.

AB - We address highly dynamic distributed systemsmodeled by time-varying graphs (TVGs). We are interested inproof of impossibility results that often use informal argumentsabout convergence. First, we provide a topological distance metricover sets of TVGs to correctly define the convergence of TVGsequences in such sets. Next, we provide a general framework thatformally proves the convergence of the sequence of executionsof any deterministic algorithm over TVGs of any convergentsequence of TVGs. Finally, we illustrate the relevance of theabove result by proving that no deterministic algorithm exists tocompute the underlying graph of any connected-over-time TVG,i.e., any TVG of the weakest class of long-lived TVGs.

M3 - Conference contribution

SP - 0

EP - 0

BT - IEEE International Symposium on Parallel & Distributed Processing, Workshops

PB - IEEE Conference Publishing

ER -