"Gossip-based Protocols", seminar by Mark Jelasaity, Hungarian Academy Sc. and University of Szeged.

20 September, 2007 - 15:20

Time: Thursday, September 20th, 2007, 15.00Place: Room Knuth, SICSGossip protocols were first proposed in the late 80's by Demers et alfor spreading database updates for a large number of replicas, to solvescalability problems with previous approaches. Due to theirprobabilistic nature, gossip protocols can remain very simple whileproviding fast convergence, extreme scalability and high robustness tobenign failure. Since their first applications, gossip protocols havegained substantial popularity, and both their theoretical background andtheir applications have been developed, partly relying on mathematical models of epidemics and complex networks. In recent years, theapplication area of gossip protocols has also been extended frominformation dissemination to various other areas such as dataaggregation, peer-to-peer overlay network management, and many morefields. In the talk we start from their first applications, we mentionthe most characteristic theoretical results, and we describe someinteresting generalizations of the concept of gossiping as well.