Tight Bounds for Asymptotic and Approximate Consensus

We study the performance of asymptotic and approximate consensus algorithms under harsh environmental conditions. The asymptotic consensus problem requires a set of agents to repeatedly set their outputs such that the outputs converge to a common value within the convex hull of initial values. This problem, and the related approximate consensus problem, are fundamental building blocks in distributed systems where exact consensus among agents is not required or possible, e.g., man-made distributed control systems, and have applications in the analysis of natural distributed systems, such as flocking and opinion dynamics. We prove tight lower bounds on the contraction rates of asymptotic consensus algorithms in dynamic networks, from which we deduce bounds on the time complexity of approximate consensus algorithms. In particular, the obtained bounds show optimality of asymptotic and approximate consensus algorithms presented in [Charron-Bost et al., ICALP'16] for certain dynamic networks, including the weakest dynamic network model in which asymptotic and approximate consensus are solvable. As a corollary we also obtain asymptotically tight bounds for asymptotic consensus in the classical asynchronous model with crashes. Central to our lower bound proofs is an extended notion of valency, the set of reachable limits of an asymptotic consensus algorithm starting from a given configuration. We further relate topological properties of valencies to the solvability of exact consensus, shedding some light on the relation of these three fundamental problems in dynamic networks.

[1]  André Schiper,et al.  The Heard-Of model: computing in distributed systems with benign faults , 2009, Distributed Computing.

[2]  Asuman E. Ozdaglar,et al.  Rate of Convergence for Consensus with Delays , 2008, 2008 47th IEEE Conference on Decision and Control.

[3]  Alex Olshevsky.  Linear time average consensus on fixed graphs , 2015 .

[4]  M. Hoagland,et al.  Feedback Systems An Introduction for Scientists and Engineers SECOND EDITION , 2015 .

[5]  Tamer Basar,et al.  Convergence Time for Unbiased Quantized Consensus Over Static and Dynamic Networks , 2014, IEEE Transactions on Automatic Control.

[6]  Ling Shi,et al.  Decentralised minimum-time consensus , 2013, Autom..

[7]  Maurice Herlihy,et al.  Multidimensional agreement in Byzantine systems , 2014, Distributed Computing.

[8]  Danny Dolev,et al.  Optimal Resilience Asynchronous Approximate Agreement , 2004, OPODIS.

[9]  David Angeli,et al.  Stability of leaderless discrete-time multi-agent systems , 2006, Math. Control. Signals Syst..

[10]  Nancy A. Lynch,et al.  Easy impossibility proofs for distributed consensus problems , 1985, PODC '85.

[11]  Vicsek,et al.  Novel type of phase transition in a system of self-driven particles. , 1995, Physical review letters.

[12]  John N. Tsitsiklis,et al.  On distributed averaging algorithms and quantization effects , 2007, 2008 47th IEEE Conference on Decision and Control.

[13]  Derek Gatherer.  Identifying cases of social contagion using memetic isolation: comparison of the dynamics of a multisociety simulation with an ethnographic data set , 2002, J. Artif. Soc. Soc. Simul..

[14]  Matthias Függer,et al.  Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms , 2014, ICALP.

[15]  S. Strogatz,et al.  Synchronization of pulse-coupled biological oscillators , 1990 .

[16]  Matthias Függer,et al.  Fast, Robust, Quantizable Approximate Consensus , 2016, ICALP.

[17]  Rainer Hegselmann,et al.  Opinion dynamics and bounded confidence: models, analysis and simulation , 2002, J. Artif. Soc. Soc. Simul..

[18]  Jon Atli Benediktsson,et al.  Consensus theoretic classification methods , 1992, IEEE Trans. Syst. Man Cybern..

[19]  Tamer Basar,et al.  Convergence time for unbiased quantized consensus , 2013, 52nd IEEE Conference on Decision and Control.

[20]  Alan Fekete.  Asynchronous approximate agreement , 1987, PODC '87.

[21]  Shlomo Moran,et al.  Closed schedulers: a novel technique for analyzing asynchronous protocols , 1995, Distributed Computing.

[22]  Jie Lin,et al.  The multi-agent rendezvous problem , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[23]  M. Cao,et al.  A Lower Bound on Convergence of a Distributed Network Consensus Algorithm , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[24]  Brian D. O. Anderson,et al.  Reaching a Consensus in a Dynamically Changing Environment: Convergence Rates, Measurement Delays, and Asynchronous Events , 2008, SIAM J. Control. Optim..

[25]  Qun Li,et al.  Global clock synchronization in sensor networks , 2006, IEEE Transactions on Computers.

[26]  George Cybenko,et al.  Dynamic Load Balancing for Distributed Memory Multiprocessors , 1989, J. Parallel Distributed Comput..

[27]  Luc Moreau,et al.  Stability of multiagent systems with time-dependent communication links , 2005, IEEE Transactions on Automatic Control.

[28]  Emmanuel Godard,et al.  A characterization of oblivious message adversaries for which Consensus is solvable , 2015, Theor. Comput. Sci..

[29]  John N. Tsitsiklis,et al.  Convergence Speed in Distributed Consensus and Averaging , 2009, SIAM J. Control. Optim..

[30]  Bernard Chazelle,et al.  The Total s-Energy of a Multiagent System , 2010, SIAM J. Control. Optim..

[31]  Nancy A. Lynch,et al.  Reaching approximate agreement in the presence of faults , 1986, JACM.

[32]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[33]  Alan Fekete,et al.  Asymptotically optimal algorithms for approximate agreement , 1986, PODC '86.