Results 21  30
of
128
A Gossip Protocol for Subgroup Multicast
 IN INTERNATIONAL WORKSHOP ON APPLIED RELIABLE GROUP COMMUNICATION
, 2001
"... Gossipbased multicast can be an effective tool for providing highly reliable and scalable message dissemination. Previous work has shown it to be useful in a variety of group communication settings when processes all belong to a single process group. In this paper, we consider the problem of gossip ..."
Abstract

Cited by 21 (3 self)
 Add to MetaCart
Gossipbased multicast can be an effective tool for providing highly reliable and scalable message dissemination. Previous work has shown it to be useful in a variety of group communication settings when processes all belong to a single process group. In this paper, we consider the problem of gossiping within overlapping process subgroups. If each subgroup independently runs the standard gossip protocol, then the total gossip overhead could be high for a process that is a member of many subgroups. We present anovel gossip protocol that allows individual subgroup members to tradeoff update quality for gossip overhead, enabling processes to belong to several subgroups while maintaining a low total gossip overhead. Our results include a mathematical model for message dissemination under this modified gossip protocol, and an algorithm that computes gossip parameters such that all processes within a subgroup achieve their desired update quality. Preliminary results are promising.
Diffusion without False Rumors: On Propagating Updates in a Byzantine Environment
 Theoretical Computer Science
, 2003
"... We study how to efficiently diffuse updates to a large distributed system of data replicas, some of which may exhibit arbitrary (Byzantine) failures. We assume that strictly fewer than t replicas fail, and that each update is initially received by at least t correct replicas. The goal is to diffus ..."
Abstract

Cited by 20 (2 self)
 Add to MetaCart
We study how to efficiently diffuse updates to a large distributed system of data replicas, some of which may exhibit arbitrary (Byzantine) failures. We assume that strictly fewer than t replicas fail, and that each update is initially received by at least t correct replicas. The goal is to diffuse each update to all correct replicas while ensuring that correct replicas accept no updates generated spuriously by faulty replicas. To achieve this, each correct replica further propagates an update only after receiving it from at least t others. In this way, no correct replica will ever propagate or accept an update that only faulty replicas introduce, since it will receive that update from only the t 1 faulty replicas.
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 ..."
Abstract

Cited by 18 (6 self)
 Add to MetaCart
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 rumor spreading inform all nodes of the network in logarithmic time with high probability. This expansion property is satisfied, among others, by many expander graphs, random regular graphs, and ErdősRényi random graphs. For all network topologies, we show that if one of the push or pull model works well, so does the other. We also show that quasirandom rumor spreading is robust against transmission failures. If each message sent out gets lost with probability f, then the runtime increases only by a factor of O(1/(1 − f)).
Social networks spread rumors in sublogarithmic time
 IN STOC
, 2011
"... With the prevalence of social networks, it has become increasingly important to understand their features and limitations. It has been observed that information spreads extremely fast in social networks. We study the performance of randomized rumor spreading protocols on graphs in the preferential a ..."
Abstract

Cited by 14 (5 self)
 Add to MetaCart
With the prevalence of social networks, it has become increasingly important to understand their features and limitations. It has been observed that information spreads extremely fast in social networks. We study the performance of randomized rumor spreading protocols on graphs in the preferential attachment model. The wellknown random phone call model of Karp et al. (FOCS 2000) is a pushpull strategy where in each round, each vertex chooses a random neighbor and exchanges information with it. We prove the following. • The pushpull strategy delivers a message to all nodes within Θ(log n) rounds with high probability. The best known bound so far was O(log 2 n). • If we slightly modify the protocol so that contacts are chosen uniformly from all neighbors but the one contacted in the previous round, then this time reduces to Θ(log n / log log n), which is the diameter of the graph. This is the first time that a sublogarithmic broadcast time is proven for a natural setting. Also, this is the first time that avoiding doublecontacts reduces the runtime to a smaller order of magnitude.
On the runtime and robustness of randomized broadcasting
 In Proc. of ISAAC’ 06
, 2006
"... Abstract. One of the most frequently studied problems in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized broadcasting protocol. At some time t an information r is placed at one of the nodes of a graph. I ..."
Abstract

Cited by 14 (5 self)
 Add to MetaCart
Abstract. One of the most frequently studied problems in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized broadcasting protocol. At some time t an information r is placed at one of the nodes of a graph. In the succeeding steps, each informed node chooses one neighbor, independently and uniformly at random, and informs this neighbor by sending a copy of r to it. In this work, we develop tight bounds on the runtime of the algorithm described above, and analyze its robustness. First, it is shown that on Δregular graphs this algorithm requires at least log2 − 1 N +log Δ
Information Dissemination via Gossip: Applications to Averaging and Coding”. available at http:// www.arXiv.org /cs.NI/0504029
"... We study distributed algorithms, also known as gossip algorithms, for information dissemination in an arbitrary connected network of nodes. Distributed algorithms have applications to peertopeer, sensor, and ad hoc networks, in which nodes operate under limited computational, communication, and en ..."
Abstract

Cited by 14 (2 self)
 Add to MetaCart
We study distributed algorithms, also known as gossip algorithms, for information dissemination in an arbitrary connected network of nodes. Distributed algorithms have applications to peertopeer, sensor, and ad hoc networks, in which nodes operate under limited computational, communication, and energy resources. These constraints naturally give rise to “gossip” algorithms: schemes in which nodes repeatedly communicate with randomly chosen neighbors, thus distributing the computational burden across all the nodes in the network. We analyze the information dissemination problem under the gossip constraint for arbitrary networks, and find that the information dissemination time of a gossip algorithm is strongly related to the isoperimetric properties of the underlying graph. This characterization allows us to formulate the problem of finding the fastest information dissemination algorithm as a concave maximization problem over the convex set of graphconformant doubly stochastic matrices. Next, we use these results for two seemingly unrelated important questions: distributed averaging and coding based information dissemination. For averaging, we analyze an algorithm based on a classic result of Flajolet and Martin [7]. Information dissemination based on coding was introduced by Deb and Médard [6]. They showed the virtue of coding by analyzing a coding algorithm for a complete graph. Although their scheme generalizes to arbitrary graphs, the analysis does not. We present an analysis of this algorithm for arbitrary graphs, which suggests that for a large class of graphs, such as gridlike graphs, codingbased algorithms do not seem to improve performance. Finally, we apply our results to several classes of graphs: complete graphs, expander graphs, and grid graphs. 1
Information spreading in stationary markovian evolving graphs
 In Proc. of the 23rd IEEE International Parallel and Distributed Processing Symposium (IPDPS
, 2009
"... Markovian evolving graphs [2] are dynamicgraph models where the links among a fixed set of nodes change during time according to an arbitrary Markovian rule. They are extremely general and they can well describe important dynamicnetwork scenarios. We study the speed of information spreading in the ..."
Abstract

Cited by 13 (3 self)
 Add to MetaCart
Markovian evolving graphs [2] are dynamicgraph models where the links among a fixed set of nodes change during time according to an arbitrary Markovian rule. They are extremely general and they can well describe important dynamicnetwork scenarios. We study the speed of information spreading in the stationary phase by analyzing the completion time of the flooding mechanism. We prove a general theorem that establishes an upper bound on flooding time in any stationary Markovian evolving graph in terms of its nodeexpansion properties. We apply our theorem in two natural and relevant cases of such dynamic graphs: edgeMarkovian evolving graphs [24, 7] where the probability of existence of any edge at time t depends on the existence (or not) of the same edge at time t − 1; geometric Markovian evolving graphs [4, 10, 9] where the Markovian behaviour is yielded by n mobile radio stations, with fixed transmission radius, that perform n independent random walks over a square region of the plane. In both cases, the obtained upper bounds are shown to be nearly tight and, in fact, they turn out to be tight for a large range of the values of the input parameters. 1
Buffer management in probabilistic peertopeer communication protocols
 Proceedings of the 22nd Symposium on Reliable Distributed Systems (SRDS
"... ..."
Nonuniform random membership management in peertopeer networks
 In Proc. of the IEEE INFOCOM
, 2005
"... Abstract — Existing random membership management algorithms provide each node with a small, uniformly random subset of global participants. However, many applications would benefit more from nonuniform random member subsets. For instance, nonuniform gossip algorithms can provide distancebased prop ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
Abstract — Existing random membership management algorithms provide each node with a small, uniformly random subset of global participants. However, many applications would benefit more from nonuniform random member subsets. For instance, nonuniform gossip algorithms can provide distancebased propagation bounds and thus information can reach nearby nodes sooner. In another example, Kleinberg shows that networks with random longlinks following distancebased nonuniform distributions exhibit better routing performance than those with uniformly randomized topologies. In this paper, we propose a scalable nonuniform random membership management algorithm, which provides each node with a random membership subset with applicationspecified probability distributions—e.g., with probability inversely proportional to distances. Our algorithm is the first nonuniform random membership management algorithm with proved convergence and bounded convergence time. Moreover, our algorithm does not put specific restrictions on the network topologies and thus have wide applicability. I.
Broadcasting vs. mixing and information dissemination on Cayley graphs
 In 24th Int. Symp. on Theor. Aspects of Computer Science (STACS
, 2007
"... Abstract. One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized broadcasting protocol: At some time t an information r is placed at one of the nodes of a graph G. In the succe ..."
Abstract

Cited by 12 (6 self)
 Add to MetaCart
Abstract. One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized broadcasting protocol: At some time t an information r is placed at one of the nodes of a graph G. In the succeeding steps, each informed node chooses one neighbor, independently and uniformly at random, and informs this neighbor by sending a copy of r to it. First, we consider the relationship between randomized broadcasting and random walks on graphs. In particular, we prove that the runtime of the algorithm described above is upper bounded by the corresponding mixing time, up to a logarithmic factor. One key ingredient of our proofs is the analysis of a continuoustype version of the afore mentioned algorithm, which might be of independent interest. Then, we introduce a general class of Cayley graphs, including (among others) Star graphs, Transposition graphs, and Pancake graphs. We show that randomized broadcasting has optimal runtime on all graphs belonging to this class. Finally, we develop a new proof technique by combining martingale tail estimates with combinatorial methods. Using this approach, we show the optimality of our algorithm on another Cayley graph and obtain new knowledge about the runtime distribution on several Cayley graphs. 1