Quasirandom rumor spreading
نویسندگان
چکیده
منابع مشابه
A Quasirandom Rumor Spreading
Randomized rumor spreading or random phone call protocols are simple randomized epidemic algorithms designed to distribute a piece of information in a network. They build on the basic paradigm that informed vertices call random neighbors to inform them (push model), or that uninformed vertices call random neighbors to become informed if the neighbor is (pull model). Despite the simple concept, ...
متن کاملTight Bounds for Quasirandom Rumor Spreading
This paper addresses the following fundamental problem: Suppose that in a group of n people, where each person knows all other group members, a single person holds a piece of information that must be disseminated to everybody within the group. How should the people propagate the information so that after short time everyone is informed? The classical approach, known as the push model, requires ...
متن کاملA Quasirandom Rumor Spreading: An Experimental Analysis
We empirically analyze two versions of the well-known “randomized rumor spreading” protocol to disseminate a piece of information in networks. In the classical model, in each round each informed node informs a random neighbor. In the recently proposed quasirandom variant, each node has a (cyclic) list of its neighbors. Once informed, it starts at a random position of the list, but from then on ...
متن کاملQuasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
Randomized rumor spreading is an efficient protocol to distribute information in networks. Recently, a quasirandom version has been proposed and proven to work equally well on many graphs and better for sparse random graphs. In this work we show three main results for the quasirandom rumor spreading model. We exhibit a natural expansion property for networks which suffices to make quasirandom r...
متن کاملRandomness-Efficient Rumor Spreading
We study the classical rumor spreading problem, which is used to spread information in an unknown network with n nodes. We present the first protocol for any expander graph G with n nodes and minimum degree Θ(n) such that, the protocol informs every node in O(log n) rounds with high probability, and uses O(log n log log n) random bits in total. The runtime of our protocol is tight, and the rand...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Journal of Experimental Algorithmics
سال: 2011
ISSN: 1084-6654,1084-6654
DOI: 10.1145/1963190.2025379