Rohit Parikh has written on levels of knowledge [PK92]. Levels of knowledge are relevant for the analysis of gossip protocols. Gossip protocols describe the dissemination of information over a network. We present some examples of epistemic gossip protocols, wherein the agents or processes communicate with each other by peer-to-peer contact (telephone calls), as in the usal gossip protocols, but...

Gossip-based protocols are very robust and are able to distribute the load uniformly among all processes. Furthermore, gossip-protocols circumvent the oscillatory phenomena that are known to occur with other forms of reliable multicast. As a result, they are excellent candidates to support the dissemination of information in large-scale datacenters. However, in this context, topology oblivious ...

Gossip protocols have been shown to be a useful tool in the development of simple, robust, and efficient distributed systems. This thesis addresses a number of problems associated with gossip protocols, including dealing with the failure of a large fraction of the hosts in a system, accommodating the topology of the underlying network, improving the efficiency of information exchange between ho...

Communication is a constant part of Teaching Learning Process. The act transferring information from one place, person or group to another called communication. People who lie in the top hierarchy usually control formal channel basically travels through informal channels, “the grapevine.” Basically term grapevine communication originated during early Civil War days when telegraph wires strung t...

The gossip-based distributed projected subgradient algorithms (DPS) are widely used to solve decentralized optimization problems in various multi-agent applications, while they generally vulnerable data injection attacks by internal malicious agents as each agent locally estimates its descent direction without an authorized supervision. In this work, we explore the application of artificial int...

In this paper we use a gossip algorithm to obtain the projection of the observed signal into a subspace of lower dimension. Gossip algorithms allow distributed, fast and efficient computations on a Wireless Sensor Network and they can be properly modified to evaluate the sought projection. By combining computation coding with gossip algorithms we proposed a novel strategy that leads to importan...

The interactions among peers in Peer-to-Peer systems as a distributed collaborative system are based on asynchronous and unreliable communications. Trust is an essential and facilitating component in these interactions specially in such uncertain environments. Various attacks are possible due to large-scale nature and openness of these systems that affects the trust. Peers has not enough inform...