Algebraic gossip: a network coding approach to optimal multiple rumor mongering

  • Authors:

  • Supratim Deb;Muriel Médard;Clifford Choute

  • Affiliations:

  • Bell-Labs India, Lucent Technologies, Koramangla Industrial Bangalore, India;Laboratory for Information & Decison Systems, Massachusetts Institute of Technology, Cambridge, MA;Susquehanna International Group, Philadelphia, PA

  • Venue:
  • IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

The problem of simultaneously disseminating k messages in a large network of n nodes, in a decentralized and distributed manner, where nodes only have knowledge about their own contents, is studied. In every discrete time-step, each node selects a communication partner randomly, uniformly among all nodes and only one message can be transmitted. The goal is to disseminate rapidly, with high probability, all messages to all nodes. It is shown that a random linear coding (RLC) based protocol disseminates all messages to all nodes in time ck + O (√k ln(k) ln(n)), where c c c k ≫ (ln(n))3, the time for simultaneous dissemination RLC is asymptotically at most ck, versus the Ω(k log2(n))3 time of sequential dissemination. Furthermore, when k ≫ (ln(n))3, the dissemination time is order optimal. When k ≪ (ln(n))2, RLC reduces dissemination time by a factor of Ω(√k/ln k) over sequential dissemination. The overhead of the RLC protocol is negligible for messages of reasonable size. A store-and-forward mechanism without coding is also considered. It is shown that this approach performs no better than a sequential approach when k=∞ n. Owing to the distributed nature of the system, the proof requires analysis of an appropriate time-varying Bernoulli process.