Bridging the Gap between Population and Gossip-based Protocols

Ad Hoc Networks, 2007

Many ad hoc routing algorithms rely on broadcast flooding for location discovery or, more generally, for secure routing applications. Flooding is a robust algorithm but because of its extreme redundancy, it is impractical in dense networks. Indeed in large wireless networks, the use of flooding algorithms may lead to broadcast storms where the number of collisions is so large that it causes system failure. To prevent broadcast storms, many mechanisms that reduce redundant transmissions have been proposed that reduce retransmission overhead either deterministically or probabilistically.

2010 IEEE Wireless Communication and Networking Conference, 2010

Gossiping, a probabilistic algorithm for networkwide broadcasting, can significantly reduce the number of transmissions in one-to-all message spread. Based on the Continuum Percolation Theory, we develop a novel analytical model of gossiping for wireless ad hoc networks. This model provides an intuitive way for setting the gossiping probability, so that a gossip achieves high degree of network coverage with limited number of transmissions. We also propose and study a distributed gossiping scheme, in which nodes set their gossiping probabilities according to locally acquired information. Both gossiping schemes are demonstrated to be scalable; i.e., for fixed network area, the expected number of gossip transmissions does not depend on the number of nodes in the network. The analytical results are verified via simulations of large ad hoc networks.

2011

Abstract By the distributed averaging problem is meant the problem of computing the average value of a set of numbers possessed by the agents in a distributed network using only communication between neighboring agents. Gossiping is a well-known approach to the problem which seeks to iteratively arrive at a solution by allowing each agent to interchange information with at most one neighbor at each iterative step.

Asian Journal of Information Technology, 2019

Gossip-based protocols for group communication have attractive scalability and reliability properties. The gossip schemes studied so far typically assume that each group member has full knowledge of the global membership and chooses gossip targets uniformly at random. In this study, we present a design of a routing algorithm that has the properties of gossip style of disseminating link state updates with the intention of making it faster than the current algorithms.

QEST, 2011

We present an analytical framework for gossip protocols based on the pair wise information exchange between interacting nodes. This framework allows for studying the impact of protocol parameters on the performance of the protocol. Previously, gossip-based information dissemination protocols have been analyzed under the assumption of perfect, lossless communication channels. We extend our framework for the analysis of networks with lossy channels. We show how the presence of message loss, coupled with specific topology configurations, impacts the expected behavior of the protocol. We validate the obtained models against simulations for two protocols.

25th IEEE International Conference on Distributed Computing Systems (ICDCS'05)

We propose and evaluate a model for controlling infection patterns defined over rounds or real time in a gossipbased protocol using adaptive fanout. We model three versions of gossip-based protocols: the Synchronous Protocol, the PseudoSynchronous Protocol and the Asynchronous Protocol. Our objective is to ensure that the members of a group receive a desired message within a bounded latency with very high probability. We argue that the most important parameter that controls the latency of message delivery is the fanout used during gossiping, i.e., the number of gossip targets chosen in a particular instance of gossip. We formally analyze the three protocols and provide expressions for fanout. We introduce the idea of using variable fanouts in different rounds in the Synchronous Protocol. We define fanout as a function of time for the Asynchronous Protocol such that an expected infection pattern is observed with high probability. For a better understanding of the theoretical model, we develop a PseudoSynchronous Protocol to highlight the modelling done in order to derive time dependent fanout. We show that our protocols generate Θ(n log n) messages, which is optimal for gossip protocols. We aim to use the gossiping mechanism for large-scale group communication with soft real time constraints. This would alleviate the dependence on tree-based deterministic protocols which usually lack scalability.

ACM SIGMETRICS Performance Evaluation Review, 2008

Gossip protocols have been proposed as a robust and efficient method for disseminating information throughout dynamically changing networks. We present an analysis of a gossip protocol using probabilistic model checking and the tool PRISM. Since the behaviour of these protocols is both probabilistic and nondeterministic in nature, this provides a good example of the exhaustive, quantitative analysis that probabilistic model checking techniques can provide. In particular, we compute minimum and maximum values, representing the best-and worst-case performance of the protocol under any scheduling, and investigate both their relationship with the average values that would be obtained through simulation and the precise scheduling which achieve these values.

University of California at San Diego, La …, 1999

Rumor mongering (also known as gossip) is an epidemiological protocol that implements broadcasting with a reliability that can be very high. Rumor mongering is attractive because it is generic, scalable, adapts well to failures and recoveries, and has a reliability that gracefully degrades with the numb e r o f f a i l u r e s i n a r u n. However, rumor mongering uses random selection for communications. We study the impact of using random selection in this paper. We present a protocol that super cially resembles rumor mongering but is deterministic. We show that this new protocol has most of the same attractions as rumor mongering. The one attraction that rumor mongering has|namely graceful degradation|comes at a high cost in terms of the number of messages sent. We compare the two approaches both at an abstract level and in terms of how they perform in an Ethernet and small wide area network of Ethernets.

2014

Gossip protocol is one of the most scalable and reliable protocol for message dissemination in a large network where nodes joins and leaves the network frequently. In this paper we have implemented gossip protocol for message/ information dissemination using two style of epidemic information dissemination i.e. rumor mongering and anti-entropy. The membership is managed by using CYCLON membership protocol. Here we analyze the change in behavior of four performance metrics of gossip protocol which are: Average Path Length, Average Clustering Coefficient; and In-degree and average message exchange with respect to different number of nodes.

2010

Gossip protocols are known to be highly robust in scenarios with high churn, but if the data that is being gossiped becomes corrupted, a protocol's very robustness can make it hard to fix the problem. All participants need to be taken down, any disk-based data needs to be scrubbed, the cause of the corruption needs to be fixed, and only then can participants be restarted. If even a single participant is skipped in this process, say because it was temporarily unreachable, then it can contaminate the entire system all over again. We describe the design and implementation of a new middleware for gossip protocols that addresses this problem. Our middleware offers the ability to update code dynamically and provides a small resilient core that allows updating code that has failed catastrophically. Our initial PlanetLab-based deployment demonstrates that the middleware is efficient.