He mainly based his talk over these papers:
- A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swinehart, and D. Terry. “Epidemic Algorithms for Replicated Database Maintenance.” In Proc. Sixth Symp. on Principles of Distributed Computing, pp. 1–12, Aug. 1987.
- Ken Birman. The Promise, and Limitations, of Gossip Protocols. ACM SIGOPS Oper. Syst. Rev., 41(5):8–13, October 2007
- Gossip-based Protocols for Large-scale Distributed Systems. Márk Jelasity, 2013
Félix talked about the paper “Epidemic Broadcast Trees” by J. Leitão, J. Pereira, and L. Rodrigues. This paper proposes an integrated broadcast scheme that combines both Gossip protocols and deterministic tree-based protocols. The paper proposes a new protocol “Plumtree”, a derivative of which is now used by Riak for gossiping bucket properties.
Here, at Félix López’s blog, you have more info about the talk.
This video was originally broadcasted at Papers We Love official website.