Title: Rumor spreading
George Giakkoupis (ASAP team, IRISA/INRIA Rennes, France)
http://www.ggiakkoupis.name/
Abstract: Epidemic algorithms are inspired by the way viruses spread in populations or rumors spread among humans. They are an attractive paradigm for distributed algorithms in large networks, for their simplicity, locality (nodes need little or no information about the network topology), and robustness. A prominent example is the class of rumor spreading algorithms. There, a piece of information, the rumor, must be disseminated from a single node to all other nodes. This is achieved by each node exchanging information with only a small random subset of its neighboring nodes in each round. Rumor spreading algorithms have been studied extensively, especially during the last decade. In this talk I will give an overview of selected topics and results in the area, and highlight some future directions.
