8 research outputs found
Strengthening Gossip Protocols using Protocol-Dependent Knowledge
Distributed dynamic gossip is a generalization of the classic telephone problem in which agents communicate to share secrets, with the additional twist that also telephone numbers are exchanged to determine who can call whom. Recent work focused on the success conditions of simple protocols such as “Learn New Secrets” (LNS) wherein an agent a may only call another agent b if a does not know b’s secret. A protocol execution is successful if all agents get to know all secrets. On partial networks these protocols sometimes fail because they ignore information available to the agents that would allow for better coordination. We study how epistemic protocols for dynamic gossip can be strengthened, using epistemic logic as a simple protocol language with a new operator for protocol-dependent knowledge. We provide definitions of different strengthenings and show that they perform better than LNS, but we also prove that there is no strengthening of LNS that always terminates successfully. Together, this gives us a better picture of when and how epistemic coordination can help in the dynamic gossip problem in particular and distributed systems in general
Everyone Knows that Everyone Knows:Gossip Protocols for Super Experts
A gossip protocol is a procedure for sharing secrets in a network. The basic action in a gossip protocol is a telephone call wherein the calling agents exchange all the secrets they know. An agent who knows all secrets is an expert. The usual termination condition is that all agents are experts. Instead, we explore protocols wherein the termination condition is that all agents know that all agents are experts. We call such agents super experts. Additionally, we model that agents who are super experts do not make and do not answer calls. Such agents are called engaged agents. We also model that such gossip protocols are common knowledge among the agents. We investigate conditions under which protocols terminate, both in the synchronous case, where there is a global clock, and in the asynchronous case, where there is not. We show that a commonly known protocol with engaged agents may terminate faster than the same protocol without engaged agents
Everyone Knows that Everyone Knows: Gossip Protocols for Super Experts
A gossip protocol is a procedure for sharing secrets in a network. The basic
action in a gossip protocol is a telephone call wherein the calling agents
exchange all the secrets they know. An agent who knows all secrets is an
expert. The usual termination condition is that all agents are experts.
Instead, we explore protocols wherein the termination condition is that all
agents know that all agents are experts. We call such agents super experts.
Additionally, we model that agents who are super experts do not make and do not
answer calls. Such agents are called engaged agents. We also model that such
gossip protocols are common knowledge among the agents. We investigate
conditions under which protocols terminate, both in the synchronous case, where
there is a global clock, and in the asynchronous case, where there is not. We
show that a commonly known protocol with engaged agents may terminate faster
than the same protocol without engaged agents