Gossip Latin square and the meet-all gossipers problem

Nethanel Gelernter; Amir Herzberg

doi:10.1016/j.ipl.2015.03.001

Gossip Latin square and the meet-all gossipers problem

Nethanel Gelernter, Amir Herzberg

Department of Computer Science

Bar-Ilan University

Research output: Contribution to journal › Article › peer-review

Abstract

Given a network of n=^2k gossipers, we want to schedule a cyclic calendar of meetings between all of them, such that: (1) each gossiper meets (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 defining and constructing the Gossip Latin Square (GLS), a combinatorial structure which solves the problem. We then present an efficient construction of GLS, based on maximal Fibonacci LFSR.

Original language	English
Pages (from-to)	738-743
Number of pages	6
Journal	Information Processing Letters
Volume	115
Issue number	10
DOIs	https://doi.org/10.1016/j.ipl.2015.03.001
State	Published - 2 Aug 2013

Bibliographical note

Publisher Copyright:
© 2015 Elsevier B.V.

Funding

We would like to thank Prof. David Peleg for his helpful comments. This research was supported by grants from the Ministry of Science and Technology , Israel, and grant 1354/11 from the Israeli Science Foundation .

Funders	Funder number
Israel Science Foundation
Ministry of science and technology, Israel	1354/11

Keywords

Combinatorial problems
Gossip
Latin square

Access to Document

10.1016/j.ipl.2015.03.001

Cite this

@article{5eed14844027432cb47f2df0dfa9dd45,

title = "Gossip Latin square and the meet-all gossipers problem",

abstract = "Given a network of n=2k gossipers, we want to schedule a cyclic calendar of meetings between all of them, such that: (1) each gossiper meets (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 defining and constructing the Gossip Latin Square (GLS), a combinatorial structure which solves the problem. We then present an efficient construction of GLS, based on maximal Fibonacci LFSR.",

keywords = "Combinatorial problems, Gossip, Latin square",

author = "Nethanel Gelernter and Amir Herzberg",

note = "Publisher Copyright: {\textcopyright} 2015 Elsevier B.V.",

year = "2013",

month = aug,

day = "2",

doi = "10.1016/j.ipl.2015.03.001",

language = "אנגלית",

volume = "115",

pages = "738--743",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier",

number = "10",

}

TY - JOUR

T1 - Gossip Latin square and the meet-all gossipers problem

AU - Gelernter, Nethanel

AU - Herzberg, Amir

PY - 2013/8/2

Y1 - 2013/8/2

N2 - Given a network of n=2k gossipers, we want to schedule a cyclic calendar of meetings between all of them, such that: (1) each gossiper meets (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 defining and constructing the Gossip Latin Square (GLS), a combinatorial structure which solves the problem. We then present an efficient construction of GLS, based on maximal Fibonacci LFSR.

AB - Given a network of n=2k gossipers, we want to schedule a cyclic calendar of meetings between all of them, such that: (1) each gossiper meets (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 defining and constructing the Gossip Latin Square (GLS), a combinatorial structure which solves the problem. We then present an efficient construction of GLS, based on maximal Fibonacci LFSR.

KW - Combinatorial problems

KW - Gossip

KW - Latin square

UR - http://www.scopus.com/inward/record.url?scp=84952863201&partnerID=8YFLogxK

U2 - 10.1016/j.ipl.2015.03.001

DO - 10.1016/j.ipl.2015.03.001

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84952863201

SN - 0020-0190

VL - 115

SP - 738

EP - 743

JO - Information Processing Letters

JF - Information Processing Letters

IS - 10

ER -

Gossip Latin square and the meet-all gossipers problem

Abstract

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this