Network coding aided gossip algorithms for information dissemination in arbitrary networks
Guosong Chu, You You · 2011
In this paper, we consider network coding aided gossip algorithms for information dissemination in arbitrary networks. We closely follow the method used in [6] to obtain the upper bounds on the time required to disseminate k messages in an arbitrary connected network, which directly extend the original work beyond the completely connected networks.