The Next 700 Impossibility Results in Time-Varying Graphs

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

[1]  Franck Petit,et al.  Enabling Minimal Dominating Set in Highly Dynamic Distributed Systems , 2015, SSS.

[2]  Franck Petit,et al.  A Generic Framework for Impossibility Results in Time-Varying Graphs , 2015, 2015 IEEE International Parallel and Distributed Processing Symposium Workshop.

[3]  Baruch Awerbuch,et al.  Efficient and Reliable Broadcast is Achievable in an Eventually Connected Network. , 1984, ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing.

[4]  Eli Upfal,et al.  Algorithms on evolving graphs , 2012, ITCS '12.

[5]  Roger Wattenhofer,et al.  An optimal maximal independent set algorithm for bounded-independence graphs , 2010, Distributed Computing.

[6]  Bernard Mans,et al.  On the Feasibility of Maintenance Algorithms in Dynamic Graphs , 2011, ArXiv.

[7]  Kevin R. Fall,et al.  A delay-tolerant network architecture for challenged internets , 2003, SIGCOMM '03.

[8]  Paola Flocchini,et al.  Deterministic algorithms in dynamic networks , 2013 .

[9]  Afonso Ferreira,et al.  Building a reference combinatorial model for MANETs , 2004, IEEE Network.

[10]  Roger Wattenhofer,et al.  Coloring unstructured wireless multi-hop networks , 2009, PODC '09.

[11]  Afonso Ferreira,et al.  Computing Shortest, Fastest, and Foremost Journeys in Dynamic Networks , 2003, Int. J. Found. Comput. Sci..

[12]  Bernard Mans,et al.  Deterministic Computations in Time-Varying Graphs: Broadcasting under Unstructured Mobility , 2010, IFIP TCS.

[13]  Afonso Ferreira,et al.  On the Evaluation of Shortest Journeys in Dynamic Networks , 2007, Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007).

[14]  Bernard Mans,et al.  Shortest, Fastest, and Foremost Broadcast in Dynamic Networks , 2012, Int. J. Found. Comput. Sci..

[15]  Serge Chaumette,et al.  Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks , 2009, SIROCCO.

[16]  Jean-Loup Guillaume,et al.  Temporal reachability graphs , 2012, Mobicom '12.