Hamiltonian quantized gossip

Proceedings of the IEEE International Conference on Control Applications

Volumn , Issue , 2009, Pages 648-654

  Franceschelli, Mauro ^a   Giua, Alessandro ^a   Seatzu, Carla ^a  

^a UNIVERSITY OF CAGLIARI   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CONSENSUS PROBLEMS; CONVERGENCE TIME; FINITE SET; HAMILTONIAN CYCLE; HAMILTONIAN GRAPH; OPTIMAL SOLUTIONS; WORST CASE;

ALGORITHMS; HAMILTONIANS; SET THEORY;

CONVERGENCE OF NUMERICAL METHODS;

EID: 74049155502     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCA.2009.5281154     Document Type: Conference Paper

References (23)

1. M. Mesbahi A. Rahmani, M. Ji and M. Egerstedt. Controllability of multi-agent systems from a graph-theoretic perspective. SIAM Journal on Control and Optimization, 48:162-186, 2009.
2. T. C. Aysal, M. J.Coates, and M. G. Rabbat. Distributed average consensus using probabilistic quantization. Statistical Signal Processing, 2007. SSP '07. IEEE/SP 14th Workshop on, pages 640-644, Aug. 2007.
3. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah. Randomized gossip algorithms. IEEE/ACM Trans. on Networking, 14:2508-2530, 2006.
4. N. H. Bshouty, L. Higham, and J. Warpechowska-Gruca. Meeting times of random walks on graphs. Inf. Process. Lett., 69(5):259-265, 1999.
5. A. Cortes, A. Ripoll, M.A. Senar, P. Pons, and E. Luque. On the performance of nearest-neighbors load balancing algorithms in parallel systems. In Proc. of the 7th Euromicro Workshop on Parallel and Distributed Processing, pages 170-177, Funchal, Portugal, February 1999.
6. G. Cybenko. Dynamic load balancing for distributed memory multiprocessors. J. of Parallel and Distributed Computing, 7:279-301, 1989.
7. M. Franceschelli, A. Giua, and C. Seatzu. Load balancing on networks with gossip based distributed algorithms. In Proc. 46th IEEE Conf. on Decision and Control, New Orleans, LA, USA, December 2007.
8. B. Ghosh, F.T. Leighton, B.M. Maggs, S. Muthukrishnan, C.G. Plax-ton, R. Rajaraman, A.W. Richa, R.E. Tarjan, and D. Zuckerman. Tight analyses of two local load balancing algorithms. SIAM J. on Computing, 29(1):29-64, 2000.
9. B. Ghosh and S. Muthukrishnan. Dynamic load balancing by random matchings. J. of Computer and Systems Sciences, 53(3):357-370, 1996.
10. F. Meyer Auf Der Heide, B. Oesterdiekhoff, and R. Wanka. Strongly adaptive token distribution. In Proc. of the 20th International Colloquium on Automata, Languages and Programming, pages 398-409, 1993.
11. M. Herlihy and S. Tirthapura. Self-stabilizing smoothing and balancing networks. Distributed Computing, 2005.
12. M.E. Houle, A. Symvonis, and D.R. Wood. Dimension exchange algorithms for token distribution on tree-connected architectures. J. of Parallel and Distributed Computing, 64:591-605, 2004.
13. M.E. Houle, E. Tempero, and G. Turner. Optimal dimension exchange token distribution on complete binary trees. Theoretical Computer Science, 220:363-377, 1999.
14. A. Jadbabaie, J. Lin, and A. S. Morse. Coordination of groups of mobile autonomous agents using nearest neighbor rules. IEEE Trans. Autom. Control, 48:988-1001, 2003.
15. A. Kashyap, T. Başar, and R. Srikant. Quantized consensus. Automatica, 43,7:1192-1203, 2007.
16. X. Lin and S. Boyd. Fast linear iterations for distributed averaging. Systems and Control Letters, 53:65-78, 2004.
17. R. Olfati-Saber. Flocking for multi-agent dynamic system: Algorithms and theory. IEEE Trans. on Automatic Control, 51:401-420, 2006.
18. R. Olfati-Saber and R. M. Murray. Consensus problems in networks of agents with switching topology and time-delays. IEEE Trans. on Automatic Control, 49:1520-1533, 2004.
19. A. Speranzon S. Zampieri R. Carli, F. Fagnani. Communication constraints in the average consensus problem. Automatica, 44.
20. S. Zampieri R. Carli. Efficient quantization in the average consensus problem. Advances in Control Theory and Applications, pages 31-49, 2007.
21. M. J. Coates T. C. Aysal and M. G. Rabbat. Distributed average consensus with dithered quantization. IEEE Transactions on Signal Processing, 56(10), OCT 2008.
22. P. Tetali and P. Winkler. On a random walk problem arising in self-stabilizing token management. In PODC '91: Proc. of the tenth annual ACM symposium on Principles of distributed computing, pages 273-280, New York, NY, USA, 1991. ACM.
23. G. Turner and H. Schroder. Token distribution on reconfigurable d-dimensional meshes. In Proc. of the First IEEE International Conference on Algorithms and Architectures for Parallel Processing, pages 335-344, 1995.