Epistemic protocols for dynamic gossip

A gossip protocol is a procedure for spreading secrets among a group of agents, using a connection graph. In each call between a pair of connected agents, the two agents share all the secrets they have learnt. In dynamic gossip problems, dynamic connection graphs are enabled by permitting agents to spread as well the telephone numbers of other agents they know. This paper characterizes different distributed epistemic protocols in terms of the (largest) class of graphs where each protocol is successful, i.e. where the protocol necessarily ends up with all agents knowing all secrets

Gossip in Dynamic Networks

A gossip protocol is a procedure for spreading secrets among a group of agents, using a connection graph. In this paper the problem of designing and analyzing gossip protocols is given a dynamic twist by assuming that when a call is established not only secrets are exchanged but also contact list, i.e., links in the gossip graph. Thus, each call in the gossip graph changes both the graph and the distribution of secrets. This paper gives a full characterization for the class of dynamic gossip graphs where the Learn New Secrets protocol (make a call to an agent if you know the number but not the secret of that agent) is successful.

Dynamic Gossip

A gossip protocol is a procedure for spreading secrets among a group of agents, using a connection graph. We consider distributed gossip protocols wherein the agents themselves instead of a global scheduler determine whom to call. In this paper the problem of designing and analyzing gossip protocols is given a dynamic twist by assuming that when a call is established not only secrets are exchanged but also telephone numbers. Both numbers and secrets can be represented by edges in a gossip graph. Thus, each call may change both the number relation and the secret relation of the graph. We define various such distributed dynamic gossip protocols, and we characterize them in terms of the class of graphs where they terminate successfully