Provably optimal decentralised broadcast algorithms

  title={Provably optimal decentralised broadcast algorithms},
  author={Laurent Massouli{\'e} and Andrew. Twigg and Christos Gkantsidis and P. Ram{\'i}rez Rodr{\'i}guez},
In this paper we consider the problem of broadcasting information from a source node to a set of receiver nodes. In the context of edge-capacitated networks, we consider the “random useful” packet forwarding algorithm. We prove that it yields a stable system, provided the data injection rate at the source node is less than the (min(min-cut)) of the graph. As a corollary we retrieve a famous theorem of Edmonds. We next consider node-capacitated networks. In this context we introduce the “random… CONTINUE READING

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
4 Extracted Citations
6 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.

Referenced Papers

Publications referenced by this paper.
Showing 1-6 of 6 references

On positive Harris recurrence of multiclass queuing networks: a unified approach via fluid limit models

  • J. G. Dai
  • Ann. of Applied Probability 5, 49-77
  • 1995
Highly Influential
8 Excerpts

Networks and Queues

  • P. Robert, Stochastic
  • 2003
2 Excerpts

Ergodicity of stochastic processes describing the operations of open queueing networks

  • A. N. Rybko, A. L. Stolyar
  • Problemy Pederachi Informatsii, 28, 2–26
  • 1992

Similar Papers

Loading similar papers…