Gossip With Transmission Constraints

Borkar, VS and Makhijani, R and Sundaresan, R (2013) Gossip With Transmission Constraints. In: Information Theory and Applications Workshop, FEB 10-15, 2013 , San Diego, CA .

PDF Inf_The_App_Wor_2013.pdf - Published Version Restricted to Registered users only Download (294kB) | Request a copy

Abstract

We consider an asynchronous stochastic approximation version of the classical gossip algorithm wherein the inter-processor communication is subject to transmission delays. We highlight some fundamental difficulties associated with it and suggest an alternative scheme based on reinforcement learning.

Item Type:	Conference Proceedings
Publisher:	IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA
Additional Information:	Copy right for this article belongs to the Information Theory and Applications Workshop, San Diego, CA, FEB 10-15, 2013
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	24 Aug 2016 09:16
Last Modified:	24 Aug 2016 09:16
URI:	http://eprints.iisc.ac.in/id/eprint/54474

Actions (login required)

View Item