Welcome to the resource topic for 2013/533
Title:
Gossip Latin Square and The Meet-All Gossipers Problem
Authors: Nethanel Gelernter, Amir Herzberg
Abstract:Given a network of n = 2^k gossipers, we want to schedule a cyclic calendar of meetings between all of them, such that: (1) each gossiper communicates (gossips) only once a day, with one other gossiper, (2) in every (n 1) consecutive days, each gossiper meets all other gossipers, and (3) every gossip, initiated by any gossiper, will reach all gossipers within k = log(n) days. In this paper we study the above stated meet-all gossipers problem, by den-ing and constructing the Gossip Latin Square (GLS), a combinatorial structure which solves the problem.
ePrint: https://eprint.iacr.org/2013/533
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .