Gossip protocols are an important building block of many large-scale systems. They have inherent loadbalancing properties as long as nodes are deployed over a network with a “flat” topology, that is, a topology where any pair of nodes may engage in a gossip exchange. Unfortunately, the Internet is not flat in the sense that firewalls and NAT boxes block many peer-wise interactions. In particula...

The communication modes (one-way and two-way mode) used for disseminating information among processors of interconnection networks via vertex-disjoint paths in one communication step are investigated. The complexity of communication algorithms is measured by the number of communication steps (rounds). Since optimal broadcast and accumulation algorithms for these modes can be achieved in a strai...

In peer-to-peer networks, free riding is a major problem. Reputation management systems can be used to overcome this problem. Reputation estimation methods generally do not considers the uncertainties in the inputs. We propose a reputation estimation method using BLUE (Best Linear Unbiased estimator) estimator that consider uncertainties in the input variables. Reputation aggregation in peer to...

Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust methods for distributed information processing over networks. However, for many topologies that are realistic for wireless adhoc and sensor networks (such as grids and random geometric graphs), the standard nearest-neighbor gossip converges however slowly. Moreover we show that conve...

Abstract My main aim in this paper is to examine whether gossip should be categorized as an epistemically valuable character trait. Gossip satisfies the necessary and jointly sufficient conditions for acquired trait classified intellectual virtue under responsibilist understanding of concept virtue. The excellent gossiper (i) motivated acquire epistemic goods through gossiping, (ii) reliably su...

We introduce a general method for constructing minimum gossip graphs on 2 k vertices, and show that this construction is suucient to get all minimum gossip graphs on 16 vertices. A complete list of all bipartite or all of diameter 4 among them is given.

We study the stopping times of gossip algorithms fornetwork coding. We analyze algebraic gossip (i.e., random linearcoding) and consider three gossip algorithms for informationspreading: Pull, Push, and Exchange. The stopping time ofalgebraic gossip is known to be linear for the complete graph, butthe question of determining a tight upper bound or lower boundsfor general...

The gossip problem (telephone problem) is an information dissemination problem in which each of n nodes of a communication network has a unique piece of information that must be transmitted to all the other nodes using two-way communications (telephone calls) between the pairs of nodes. During a call between the given two nodes, they exchange the whole information known to them at that moment. ...

Gossip protocols are communication protocols in which, periodically, every node of a network exchanges information with some other node chosen according to some (randomized) strategy. These protocols have recently found various types of applications for the management of distributed systems. Spatial gossip protocols are gossip protocols that use the underlying spatial structure of the network, ...

In this paper we discuss the viability of deploying Multiplayer Online Games (MOGs) over scale-free networks. We employ a general peer-to-peer overlay network; nodes have a number of neighbors which follows a power law distribution, pk ∼ k , the usual degree distribution that characterizes scale-free nets. Game events generated by nodes during the game evolution are disseminated through the net...