Epidemic Algorithms and Processes: From Theory to Applications (Dagstuhl Seminar 13042)

This report documents the program and the outcomes of Dagstuhl Seminar 13042 "Epidemic Algorithms and Processes: From Theory to Applications", which took place from January 20 to 25, 2013 at Schloss Dagstuhl - Leibniz Center for Informatics. Several research topics were covered by the seminar participants, including scientists working in Theoretical Computer Science, as well as researchers from the more practical area of Computer Systems. Most of the participants presented their recent results on the topic of the seminar, as well as some challenging new directions and open problems. The presentations contained a description of the main research area for a wide audience. During the seminar, ample time was reserved for informal discussions between participants working on different topics. In our executive summary, we describe the main field of the seminar, as well as our goals in general. Then, we present the abstracts of the presentations given during the seminar.

[1]  Alessandro D'Alconzo,et al.  Botnet detection revisited: Theory and practice of finding malicious P2P networks via Internet connection graphs , 2013, 2013 Proceedings IEEE INFOCOM.

[2]  João Leitão,et al.  Bounded gossip: a gossip protocol for large-scale datacenters , 2013, SAC '13.

[3]  Christian Schindelhauer,et al.  A Self-Stabilizing Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs , 2010, 2010 IEEE 16th International Conference on Parallel and Distributed Systems.

[4]  João Leitão,et al.  HyParView: A Membership Protocol for Reliable Gossip-Based Broadcast , 2007, 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07).

[5]  João Leitão,et al.  Thicket: A Protocol for Building and Maintaining Multiple Trees in a P2P Overlay , 2010, 2010 29th IEEE Symposium on Reliable Distributed Systems.