Supported by meta-analytic evidence, the general consensus in teams literature is that more a team communicates, better. However, one type of communication appears at odds with this view gossip—a behavior traditionally viewed as harmful organizations. We propose way to uncover potential benefits gossip focus on valence (positive or negative nature) gossip. Drawing expectancy theory, we indirect...

In this paper, we propose novel gossip algorithms for decentralized subspace learning problems that are modeled as finite sum problems on the Grassmann manifold. Interesting applications in this setting include low-rank matrix completion and multi-task feature learning, both of which are naturally reformulated in the considered setup. To exploit the finite sum structure, the problem is distribu...

The spreading of reputational information about group members through gossip represents a widespread, efficient, and low-cost form of punishment. Research shows that negative arousal states motivate individuals to gossip about the transgressions of group members. By sharing information in this way groups are better able to promote cooperation and maintain social control and order.

Formalisms for representing gossip problems are surveyed. A new method \calling schemes" is presented which generalizes existing methods. This survey is intended to serve primarily as a basis for future work.

C o n si st en t * lete * W ll D o c u m e n t e d * E a s y t o R e u s e * * E v a l u a t e d * E C O O P * Ar tifact * A E C The developers of today’s cloud computing systems are expected to not only create applications that will work well at scale, but also to create management services that will monitor run-time conditions and intervene to address problems as conditions evolve. Management...

Gossip-based protocols are an e cient mechanism for man-aging pure unstructured peer-to-peer (P2P) networks. Such protocols are Newscast, Cyclone, Lbpcast, etc. They have overcome from several di culties of such P2P random overlay connection. Such difficulties are randomness, high churn rate, very large unstructured distributed net-work, etc. But the performance of all gossip-based protocols ha...

Many distributed applications are beginning to employ gossip-based message dissemination, where the burden of content distribution is shared democratically among the recipient nodes, e.g., for RSS distribution. However, such systems have many communication channels, i.e., multiple gossip streams may be present within the same application, e.g., an RSS content distribution system involves severa...

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, traditional gossip-based protocols have two major drawbacks: 1) They rely on each peer having knowledge ...

Gossip-based protocols have received considerable attention for broadcast applications due to their attractive scalability and reliability properties. The reliability of probabilistic gossip schemes studied so far depends on each user having knowledge of the global membership and choosing gossip targets uniformly at random. The requirement of global knowledge is undesirable in largescale distri...

HUANG, YUFAN. Gossip-based Information Spreading in Mobile and Social Networks. (Under the direction of Dr. Huaiyu Dai.) We study the performance of gossip-based information spreading in different network models. Our study is conducted in two major different circumstances: mobile networks and social networks. In mobile networks, we mainly study two problems: single-piece information spreading w...