SIGDIAL
2010
13 years 10 months ago
2010
The purpose of this study is to get a working definition that matches people's intuitive notion of gossip and is sufficiently precise for computational implementation. We con...
P2P
2010
IEEE
13 years 10 months ago
2010
IEEE
Gossip protocols are considered very effective to disseminate information in a large scale dynamic distributed system. Their inherent simplicity makes them easy to implement and de...
SIGOPS
2010
13 years 10 months ago
2010
Gossip-based protocols are commonly used for diffusing information in large-scale distributed applications. GO (Gossip Objects) is a per-node gossip platform that we developed in...
TSP
2008
13 years 12 months ago
2008
Gossip algorithms for distributed computation are attractive due to their simplicity, distributed nature, and robustness in noisy and uncertain environments. However, using standa...
CORR
2006
Springer
14 years 4 days ago
2006
Springer
Gossip algorithms for aggregation have recently received significant attention for sensor network applications because of their simplicity and robustness in noisy and uncertain en...
CORR
2008
Springer
14 years 5 days ago
2008
Springer
Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust message-passing schemes for distributed information processing over...
ADHOC
2007
14 years 7 days ago
2007
Abstract. 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 ...
NCA
2006
IEEE
14 years 6 months ago
2006
IEEE
Gossip protocols provide probabilistic reliability and scalability, but their inherent randomness may lead to high variation in number of messages that are received at different n...
ICDCSW
2006
IEEE
14 years 6 months ago
2006
IEEE
In this paper we present a gossip based protocol for path discovery in Mobile Ad Hoc Networks (MANETs). While in the classical gossip algorithm each node forwards a packet with th...
ICASSP
2009
IEEE
14 years 6 months ago
2009
IEEE
This paper analyzes the rate of convergence of greedy gossip with eavesdropping (GGE). In previous work, we proposed GGE, a fast gossip algorithm based on exploiting the broadcast...