Gossip with transmission constraints

V. S. Borkar, R. Makhijani, R. Sundaresan
2013 2013 Information Theory and Applications Workshop (ITA)  
We consider an asynchronous stochastic approximation version of the classical gossip algorithm wherein the interprocessor communication is subject to transmission delays. We highlight some fundamental difficulties associated with it and suggest an alternative scheme based on reinforcement learning.
doi:10.1109/ita.2013.6502936 dblp:conf/ita/BorkarMS13 fatcat:6voraa7agjfwzmtjym2hngtn4e