On the Computational Complexity of Gossip Protocols

Gossip protocols deal with a group of communicating agents, each holding a private information, and aim at arriving at a situation in which all the agents know each other secrets. Distributed epistemic gossip protocols are particularly simple distributed programs that use formulas from an epistemic logic. Recently, the implementability of these distributed protocols was established (which means that the evaluation of these formulas is decidable), and the problems of their partial correctness and termination were shown to be decidable, but their exact computational complexity was left open. We show that for any monotonic type of calls the implementability of a distributed epistemic gossip protocol is a P^{NP}_{||}-complete problem, while the problems of its partial correctness and termination are in coNP^{NP}.

[1]  Wiebe van der Hoek,et al.  Epistemic Protocols for Distributed Gossiping , 2016, TARK.

[2]  Johannes Gehrke,et al.  Gossip-based computation of aggregate information , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[3]  Krzysztof R. Apt,et al.  Decidability of Fair Termination of Gossip Protocols , 2017, IWIL@LPAR.

[4]  Krzysztof R. Apt,et al.  On Decidability of a Logic of Gossips , 2016, JELIA.

[5]  Klaus W. Wagner.  More Complicated Questions About Maxima and Minima, and Some Closures of NP , 1987, Theor. Comput. Sci..

[6]  Andrzej Pelc,et al.  Dissemination of Information in Communication Networks - Broadcasting, Gossiping, Leader Election, and Fault-Tolerance , 2005, Texts in Theoretical Computer Science. An EATCS Series.

[7]  Ronald Fagin,et al.  Knowledge-based programs , 1997, Distributed Computing.

[8]  David Liben-Nowell.  Gossip is synteny: Incomplete gossip and the syntenic distance between genomes , 2002, J. Algorithms.

[9]  Fred B. Chambers,et al.  Distributed Computing , 2016, Lecture Notes in Computer Science.

[10]  Thomas Wilke,et al.  Synthesis of Distributed Systems from Knowledge-Based Specifications , 2005, CONCUR.

[11]  Andreas Herzig,et al.  How to share knowledge by gossiping , 2017, AI Commun..

[12]  Krzysztof R. Apt,et al.  Common Knowledge in a Logic of Gossips , 2017, TARK.

[13]  Martin C. Cooper,et al.  A simple account of multiagent epistemic planning , 2015 .

[14]  S. Crawford,et al.  Volume 1 , 2012, Journal of Diabetes Investigation.

[15]  Samir Khuller,et al.  Algorithms for data migration with cloning , 2003, SIAM J. Comput..

[16]  Nieuw Archief voor Wiskunde , 1892 .

[17]  E. Todeva.  Networks , 2007 .

[18]  Wiebe van der Hoek,et al.  A Framework for Epistemic Gossip Protocols , 2014, EUMAS.

[19]  Martin C. Cooper,et al.  Simple Epistemic Planning: Generalised Gossiping , 2016, ECAI.

[20]  Arthur L. Liestman,et al.  A survey of gossiping and broadcasting in communication networks , 1988, Networks.