English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Direction-reversing Quasi-random Rumor Spreading with Restarts

Winzen, C. (2013). Direction-reversing Quasi-random Rumor Spreading with Restarts. Information Processing Letters, 113(22-24), 921-926. doi:10.1016/j.ipl.2013.09.006.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Winzen, C.1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show
hide
Free keywords: -
 Abstract: Doerr and Fouz [\emphAsymptotically Optimal Randomized Rumor Spreading}, ICALP 2011] presented a new quasi-random PUSH algorithm for the rumor spreading problem on complete graphs. Their protocol is the first randomized PUSH protocol with an asymptotically optimal running time. This is achieved by equipping all nodes with the same lists, and by allowing them to do a random restart after encountering an already informed node. Here in this work, we show that the same running time can be achieved if every second random restart is replaced by a reversion of the direction in which the nodes follow their lists. Put differently, our \emph{direction-reversing quasi-random rumor spreading protocol with random restarts achieves the same running time as the hybrid model by employing only (roughly) half the number of random choices.

Details

show
hide
Language(s): eng - English
 Dates: 20132013
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: Winzen2013
DOI: 10.1016/j.ipl.2013.09.006
Other: Local-ID: 208E43C2CF9FD497C1257C60005240F9-Winzen2013
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Information Processing Letters
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: Amsterdam : Elsevier
Pages: - Volume / Issue: 113 (22-24) Sequence Number: - Start / End Page: 921 - 926 Identifier: -