منابع مشابه
Epistemic Gossip Protocols
A well-studied phenomenon in network theory since the 1970s are optimal schedules to distribute information by one-to-one communication between nodes. One can take these communicative actions to be telephone calls, and protocols to spread information this way are known as gossip protocols or epidemic protocols. Statistical approaches to gossip have taken a large fight since then, witness for ex...
متن کاملParameters for Epistemic Gossip Problems
We introduce a framework that can model different kinds of epistemic gossip problems. We also formalize some parameters that distinguish the different types of gossip problem. Finally, we present a few results that show the effect of the parameters.
متن کاملA middleware for gossip protocols
Gossip protocols are known to be highly robust in scenarios with high churn, but if the data that is being gossiped becomes corrupted, a protocol’s very robustness can make it hard to fix the problem. All participants need to be taken down, any disk-based data needs to be scrubbed, the cause of the corruption needs to be fixed, and only then can participants be restarted. If even a single parti...
متن کاملEpistemic Protocols for Distributed Gossiping
Gossip protocols aim at arriving, by means of point-to-point or group communications, at a situation in which all the agents know each other’s secrets. We consider distributed gossip protocols which are expressed by means of epistemic logic. We provide an operational semantics of such protocols and set up an appropriate framework to argue about their correctness. Then we analyze specific protoc...
متن کاملGossip Protocols for Renaming and Sorting
We devise efficient gossip-based protocols for some fundamental distributed tasks. The protocols assume an n-node network supporting point-to-point communication, and in every round, each node exchanges information of size O(logn) bits with (at most) one other node. We first consider the renaming problem, that is, to assign distinct IDs from a small ID space to all nodes of the network. We prop...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Logic
سال: 2017
ISSN: 1570-8683
DOI: 10.1016/j.jal.2016.12.001