@inproceedings{Massouli2006ProvablyOD,
title={Provably optimal decentralised broadcast algorithms},
author={Laurent Massouli{\'e} and Andrew. Twigg and Christos Gkantsidis and P. Ram{\'i}rez Rodr{\'i}guez},
year={2006}
}

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