Cryptology ePrint Archive: Report 2013/533

Gossip Latin Square and The Meet-All Gossipers Problem

Nethanel Gelernter and 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 de n-ing and constructing the Gossip Latin Square (GLS), a combinatorial structure which solves the problem.

Category / Keywords: Latin-square, gossip

Date: received 26 Aug 2013

Contact author: nethanel gelernter at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20130830:092342 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]