Dynamic Gossip

@article{Ditmarsch2015DynamicG,
  title={Dynamic Gossip},
  author={H. V. Ditmarsch and J. V. Eijck and P. Pardo and Rahim Ramezanian and François Schwarzentruber},
  journal={Bulletin of the Iranian Mathematical Society},
  year={2015},
  volume={45},
  pages={701-728}
}
  • H. V. Ditmarsch, J. V. Eijck, +2 authors François Schwarzentruber
  • Published 2015
  • Computer Science, Mathematics
  • Bulletin of the Iranian Mathematical Society
  • A gossip protocol is a procedure for spreading secrets among a group of agents, using a connection graph. The goal is for all agents to get to know all secrets, in which case we call the execution of the protocol successful. We consider distributed and dynamic gossip protocols. In distributed gossip, the agents themselves instead of a global scheduler determine whom to call. In dynamic gossip, not only secrets are exchanged but also telephone numbers (agent identities). This results in… CONTINUE READING
    13 Citations
    Gossip in Dynamic Networks
    • 2
    • PDF
    Strengthening Gossip Protocols using Protocol-Dependent Knowledge
    Reachability of Five Gossip Protocols
    The Expected Duration of Sequential Gossiping
    • 2
    Reachability of Five Gossip Protocols
    The logic of gossiping
    • 1
    Open Problems in a Logic of Gossips
    • 1
    • PDF
    On Decidability of a Logic of Gossips
    • 5
    • PDF
    How to Share Knowledge by Gossiping
    • 9
    • PDF

    References

    SHOWING 1-10 OF 28 REFERENCES
    Knowledge and Gossip
    • 29
    Discovery through gossip
    • 19
    • PDF
    Epistemic Protocols for Distributed Gossiping
    • 29
    • PDF
    Quasirandom rumor spreading
    • 61
    Gossiping in distributed systems
    • 191
    • PDF
    The Pleasure of Gossip
    • 8
    • PDF
    Resource discovery in distributed networks
    • 229
    • PDF