Quantized consensus in Hamiltonian graphs

The main contribution of this paper is an algorithm to solve an extended version of the quantized consensus problem over networks represented by Hamiltonian graphs, i.e., graphs containing a Hamiltonian cycle, which we assume to be known in advance. Given a network of agents, we assume that a certain number of tokens should be assigned to the agents, so that the total number of tokens weighted by their sizes is the same for all the agents. The algorithm is proved to converge almost surely to a finite set containing the optimal solution. A worst case study of the expected convergence time is carried out, thus proving the efficiency of the algorithm with respect to other solutions recently presented in the literature. Moreover, the algorithm has a decentralized stop criterion once the convergence set is reached.

[1]  R. Srikant,et al.  Quantized Consensus , 2006, 2006 IEEE International Symposium on Information Theory.

[2]  Maurice Herlihy,et al.  Self-stabilizing smoothing and balancing networks , 2006, Distributed Computing.

[3]  Jie Lin,et al.  Coordination of groups of mobile autonomous agents using nearest neighbor rules , 2003, IEEE Trans. Autom. Control..

[4]  Javad Lavaei,et al.  On quantized consensus by means of gossip algorithm - Part II: Convergence time , 2009, 2009 American Control Conference.

[5]  Alessandro Giua,et al.  Hamiltonian quantized gossip , 2009, 2009 IEEE Control Applications, (CCA) & Intelligent Control, (ISIC).

[6]  Stephen P. Boyd,et al.  Fast linear iterations for distributed averaging , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[7]  B. Bollobás,et al.  An algorithm for finding hamilton paths and cycles in random graphs , 1987 .

[8]  Michael Rabbat,et al.  Distributed Average Consensus using Probabilistic Quantization , 2007, 2007 IEEE/SP 14th Workshop on Statistical Signal Processing.

[9]  Ewan D. Tempero,et al.  Optimal Dimension-Exchange Token Distribution on Complete Binary Trees , 1999, Theor. Comput. Sci..

[10]  Laura Giarré,et al.  Non-linear protocols for optimal distributed consensus in networks of dynamic agents , 2006, Syst. Control. Lett..

[11]  Max Donath,et al.  American Control Conference , 1993 .

[12]  Richard M. Murray,et al.  Consensus problems in networks of agents with switching topology and time-delays , 2004, IEEE Transactions on Automatic Control.

[13]  Alessandro Giua,et al.  A Gossip-Based Algorithm for Discrete Consensus Over Heterogeneous Networks , 2010, IEEE Transactions on Automatic Control.

[14]  Jeannette Janssen,et al.  Combinatorial and Algorithmic Aspects of Networking, 4th Workshop, CAAN 2007, Halifax, Canada, August 14, 2007. Revised Papers , 2007, CAAN.

[15]  Reza Olfati-Saber,et al.  Flocking for multi-agent dynamic systems: algorithms and theory , 2006, IEEE Transactions on Automatic Control.

[16]  Stephen P. Boyd,et al.  Randomized gossip algorithms , 2006, IEEE Transactions on Information Theory.

[17]  Sonia Martínez,et al.  On the convergence time of distributed quantized averaging algorithms , 2008, 2008 47th IEEE Conference on Decision and Control.

[18]  T. C. Aysal,et al.  Distributed Average Consensus With Dithered Quantization , 2008, IEEE Transactions on Signal Processing.

[19]  Ruggero Carli,et al.  Communication constraints in the average consensus problem , 2008, Autom..

[20]  Khaled Day,et al.  Embedding of Cycles in Arrangement Graphs , 1993, IEEE Trans. Computers.

[21]  Ruggero Carli,et al.  Gossip consensus algorithms via quantized communication , 2009, Autom..

[22]  Guy Louchard,et al.  A distributed algorithm to find Hamiltonian cycles in G(n, p) random graphs , 2005 .

[23]  Bonaventure Intercontinental,et al.  ON DECISION AND CONTROL , 1985 .

[24]  S. Muthukrishnan,et al.  Dynamic Load Balancing by Random Matchings , 1996, J. Comput. Syst. Sci..

[25]  Javad Lavaei,et al.  On quantized consensus by means of gossip algorithm - Part I: Convergence proof , 2009, 2009 American Control Conference.

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

[27]  T.I. Fenner,et al.  On the existence of Hamiltonian cycles in a class of random graphs , 1983, Discret. Math..

[28]  Lisa Higham,et al.  Meeting Times of Random Walks on Graphs , 1999, Inf. Process. Lett..

[29]  Guy Louchard,et al.  A Distributed Algorithm to Find Hamiltonian Cycles in Random Graphs , 2004, CAAN.

[30]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[31]  Alessandro Giua,et al.  Load balancing on networks with gossip-based distributed ]algorithms , 2007, 2007 46th IEEE Conference on Decision and Control.

[32]  R. Carli,et al.  Efficient Quantization in the Average Consensus Problem , 2007 .

[33]  Peter Winkler,et al.  On a random walk problem arising in self-stabilizing token management , 1991, PODC '91.

[34]  Norman C. Strole,et al.  A Token-Ring Network for Local Data Communications , 1983, IBM Syst. J..

[35]  H. Schroder,et al.  Token distribution on reconfigurable d-dimensional meshes , 1995, Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing.

[36]  Antonios Symvonis,et al.  Dimension-exchange algorithms for token distribution on tree-connected architectures , 2004, J. Parallel Distributed Comput..

[37]  Bruce M. Maggs,et al.  Tight analyses of two local load balancing algorithms , 1995, STOC '95.

[38]  Friedhelm Meyer auf der Heide,et al.  Strongly Adaptive Token Distribution , 1993, ICALP.

[39]  Ana Cortés,et al.  On the performance of nearest-neighbors load balancing algorithms in parallel systems , 1999, Proceedings of the Seventh Euromicro Workshop on Parallel and Distributed Processing. PDP'99.

[40]  János Komlós,et al.  Limit distribution for the existence of hamiltonian cycles in a random graph , 1983, Discret. Math..