## Gossip
If you only read one of these papers, start with the classic Demers, et al paper:
* [Epidemic Algorithms for Replicated Database Maintenance ](http://bitsavers.informatik.uni-stuttgart.de/pdf/xerox/parc/techReports/CSL-89-1_Epidemic_Algorithms_for_Replicated_Database_Maintenance.pdf )
# Peer sampling services
Briefly, a peer sampling service is a system that maintains a restricted set (partial view) of the all machines participating in a gossip system.
* [The Peer Sampling Service: Experimental Evaluation of Unstructured Gossip-Based Implementations ](http://infoscience.epfl.ch/record/83409/files/neg--1184036295all.pdf )
* [HyParView: a membership protocol for reliable gossip-based broadcast ](http://asc.di.fct.unl.pt/~jleitao/pdf/dsn07-leitao.pdf )
* [SWIM: Scalable Weakly-consistent Infection-style Process Group Membership Protocol ](http://research.cs.cornell.edu/projects/Quicksilver/public_pdfs/SWIM.pdf )
# Epidemic broadcast
* [Large-Scale Newscast Computing on the Internet ](http://www.researchgate.net/profile/Maarten-Van-Steen/publication/2479853_Large-Scale_Newscast_Computing_on_the_Internet/links/579132c708ae0831552f97f4/Large-Scale-Newscast-Computing-on-the-Internet.pdf )
* [Bimodal Multicast ](http://www.csl.mtu.edu/cs6461/www/Reading/Birman99.pdf )
* [Efficient Reconciliation and Flow Control for Anti-Entropy Protocols ](http://www.cs.cornell.edu/home/rvr/papers/flowgossip.pdf )
* [Epidemic Broadcast Trees ](http://www.gsd.inesc-id.pt/~ler/reports/srds07.pdf )
# Failure Detectors
* [A Gossip-Style Failure Detection Service ](https://ecommons.cornell.edu/bitstream/handle/1813/7341/98-1687.pdf )
* [The ϕ Accrual Failure Detector ](https://dspace.jaist.ac.jp/dspace/bitstream/10119/4784/1/IS-RR-2004-010.pdf )
