Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
65
Gossip-based aggregation in large dynamic networks
- ACM TRANS. COMPUT. SYST
, 2005
"... As computer networks increase in size, become more heterogeneous and span greater geographic distances, applications must be designed to cope with the very large scale, poor reliability, and often, with the extreme dynamism of the underlying network. Aggregation is a key functional building block fo ..."
Abstract
-
Cited by 271 (43 self)
- Add to MetaCart
from knowing the target average load so as to minimize the load they transfer. We propose a gossip-based protocol for computing aggregate values over network components in a fully decentralized fashion. The class of aggregate functions we can compute is very broad and includes many useful special cases
Peer-to-peer membership management for gossip-based protocols
- IEEE TRANSACTIONS ON COMPUTERS
, 2003
"... Gossip-based protocols for group communication have attractive scalability and reliability properties. The probabilistic 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. The requirement ..."
Abstract
-
Cited by 222 (23 self)
- Add to MetaCart
Gossip-based protocols for group communication have attractive scalability and reliability properties. The probabilistic 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. The requirement
PlanetP: Using Gossiping to Build Content Addressable Peer-to-Peer Information Sharing Communities
, 2003
"... Abstract. We present PlanetP, a peer-to-peer (P2P) content search and retrieval infrastructure targeting communities wishing to share large sets of text documents. P2P computing is an attractive model for information sharing between ad hoc groups of users because of its low cost of entry and explici ..."
Abstract
-
Cited by 194 (11 self)
- Add to MetaCart
Abstract. We present PlanetP, a peer-to-peer (P2P) content search and retrieval infrastructure targeting communities wishing to share large sets of text documents. P2P computing is an attractive model for information sharing between ad hoc groups of users because of its low cost of entry
Probabilistic Reliable Dissemination in Large-Scale Systems
- IEEE Transactions on Parallel and Distributed Systems
, 2001
"... The growth of the Internet raises new challenges for the design of distributed systems and applications. In the context of group communication protocols, gossip-based schemes have attracted interest as they are scalable, easy to deploy, and resilient to network and process failures. However, tradi ..."
Abstract
-
Cited by 181 (24 self)
- Add to MetaCart
of gossip-based protocols which relates their reliability to key system parameters (system size, failure rates, and number of gossip targets). The results provide guidelines for the design of practical protocols. In particular, they show how reliability can be maintained while alleviating drawback 1
Unconscious eventual consistency with gossips
- In Proceedings of the Eighth International Symposium on Stabilization, Safety and Security of Distributed Systems
"... Abstract. We present an update ordering protocol based on gossiping for geographically distributed replicas. We target large scale distributed systems without central authority. Updates are disseminated epidemically and continuously applied to the replicas despite network partitions and asynchrony. ..."
Abstract
-
Cited by 5 (1 self)
- Add to MetaCart
Abstract. We present an update ordering protocol based on gossiping for geographically distributed replicas. We target large scale distributed systems without central authority. Updates are disseminated epidemically and continuously applied to the replicas despite network partitions and asynchrony
Gossip-based Service Coordination for
"... Many interesting emerging applications involve the coordination of a large number of service instances, for instance, as targets for dissemination or sources in information gathering. These applications raise hard architectural, scalability, and resilience issues that are not suitably addressed by c ..."
Abstract
- Add to MetaCart
Many interesting emerging applications involve the coordination of a large number of service instances, for instance, as targets for dissemination or sources in information gathering. These applications raise hard architectural, scalability, and resilience issues that are not suitably addressed
Psychological adaptations for assessing gossip veracity
- Human Nature – An Interdisciplinary Biosocial Perspective
, 2006
"... Evolutionary models of human cooperation are increasingly emphasizing the role of reputation and the requisite truthful “gossiping ” about reputation-relevant behav-ior. If resources were allocated among individuals according to their reputations, competition for resources via competition for “good ..."
Abstract
-
Cited by 19 (0 self)
- Add to MetaCart
decreased its veracity. Competition between a gossiper and her target decreased gossip veracity. These results provide preliminary evidence for psychological adap-tations for assessing gossip veracity, mechanisms that might be used to assess verac-ity in other domains involving social exchange
Controlling gossip protocol infection pattern using adaptive fanout
- In ICDCS ’05: Proc. of the 25th IEEE International Conference on Distributed Computing Systems. IEEE, 2005. Times seec nodes Fixed Probability Fixed Fanout Conditional Broadcast
"... 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 objectiv ..."
Abstract
-
Cited by 15 (0 self)
- Add to MetaCart
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
The worst case behavior of randomized gossip
"... This paper considers the quasi-random rumor spreading model introduced by Doerr, Friedrich, and Sauerwald in [SODA 2008], hereafter referred to as the list-based model. Each node is provided with a cyclic list of all its neighbors, chooses a random position in its list, and from then on calls its n ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
is the design of an O(m + n log n)-time algorithm that, given any n-node m-edge network G, and any source-target pair s, t ∈ V (G), computes the maximum number of rounds it may take for a rumor to be broadcast from s to t in G, in the list-based model. This algorithm yields an O(n(m + n log n))-time algorithm
PROSOCIAL GOSSIP 1 RUNNING HEAD: PROSOCIAL GOSSIP THE EXISTENCE AND DYNAMICS OF PROSOCIAL GOSSIP
, 2011
"... Reputation systems promote cooperation and deter antisocial behavior in groups. Little is known, however, about how and why people share reputational information. Here we seek to establish the existence and dynamics of prosocial gossip, the sharing of negative evaluative information about a target i ..."
Abstract
- Add to MetaCart
Reputation systems promote cooperation and deter antisocial behavior in groups. Little is known, however, about how and why people share reputational information. Here we seek to establish the existence and dynamics of prosocial gossip, the sharing of negative evaluative information about a target
Results 1 - 10
of
65
