A Generic Framework for Impossibility Results in Time-Varying Graphs

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.

[1]  Maria Gradinariu Potop-Butucaru,et al.  Dynamic FTSS in asynchronous systems: The case of unison , 2009, Theor. Comput. Sci..

[2]  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.

[3]  Sam Toueg,et al.  The weakest failure detector for solving consensus , 1992, PODC '92.

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

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

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

[7]  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).

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

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

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

[11]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1983, PODS '83.

[12]  Koichi Wada,et al.  How to Prove Impossibility Under Global Fairness: On Space Complexity of Self-Stabilizing Leader Election on a Population Protocol Model , 2012, Theory of Computing Systems.

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

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