Analyzing Network Coding Gossip Made Easy
The authors give a new technique to analyze the stopping time of gossip protocols that are based on Random Linear Network Coding (RLNC). The analysis drastically simplifies, extends and strengthens previous results. They analyze RLNC gossip in a general framework for network and communication models that encompasses and unifies the models used previously in this context. They show, in most settings for the first time, that it converges with high probability in the information-theoretically optimal time.