Mobility Investigate

Order-Optimal Consensus Through Randomized Path Averaging

Download now Free registration required

Executive Summary

Gossip algorithms are distributed message-passing schemes designed to disseminate and process information over networks. They have received significant interest because the problem of computing a global function of data distributively over a network, using only localized message-passing, is fundamental for numerous applications. These problems and their connections to mixing rates of Markov chains have been extensively studied starting with the pioneering work of Tsitsiklis. Earlier work studied mostly deterministic protocols, known as average consensus algorithms, in which each node communicates with each of its neighbors in every round.

  • Format: PDF
  • Size: 2048 KB