Abstract
Gossip problem is an information dissemination problem in which networked agents (nodes) must share their secrets by the minimum number of calls. In recent years, to solve the problem, various epistemic gossip protocols have been proposed, where the agents decide who to call based on the higher-order knowledge about the possession of secrets. Although most previous studies on the epistemic gossip protocol have restricted their scope to the environments including only reliable agents, from the practical viewpoint, it is worthwhile investigating robust protocols against agent failure. In this paper, we assume the existence of unreliable agents and analyze the robustness of some existing protocols using epistemic logic. In our model, when an agent fails, it loses the secrets and telephone numbers gained by previous calls and returns to its initial state. In addition, during each call, agents share not only their possessing secrets but also the history of the transmission path of each secret. For these settings, we show that the protocols ANY and PIG are successful (i.e., the protocols always lead to the state where every agent knows all secrets). We also show that the protocol CO is not immediately successful under the assumption that agents can fail, but it becomes successful if the protocol execution satisfies some conditions. Furthermore, we clarify sufficient conditions for agents to detect the failure of other agent, which are useful for designing robust protocols.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Apt, K.R., Grossi, D., van der Hoek, W.: Epistemic protocols for distributed gossiping. Electron. Proc. Theor. Comput. Sci. 215, 51–66 (2016)
Attamah, M., Van Ditmarsch, H., Grossi, D., van der Hoek, W.: Knowledge and gossip. In: ECAI, pp. 21–26 (2014)
van den Berg, L.: Unreliable gossip. Master’s thesis, Universiteit van Amsterdam (2018)
Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. J. ACM (JACM) 43(2), 225–267 (1996)
Cooper, M.C., Herzig, A., Maffre, F., Maris, F., Régnier, P.: The epistemic gossip problem. Discrete Math. 342(3), 654–663 (2019)
van Ditmarsch, H., van Eijck, J., Pardo, P., Ramezanian, R., Schwarzentruber, F.: Epistemic protocols for dynamic gossip. J. Appl. Log. 20, 1–31 (2017)
van Ditmarsch, H., van Eijck, J., Pardo, P., Ramezanian, R., Schwarzentruber, F.: Dynamic gossip. Bull. Iran. Math. Soc. 45(3), 701–728 (2019)
Fagin, R., Moses, Y., Halpern, J.Y., Vardi, M.Y.: Reasoning About Knowledge. MIT Press, Cambridge (1995)
Hajnal, A., Milner, E.C., Szemerédi, E.: A cure for the telephone disease. Can. Math. Bull. 15(3), 447–450 (1972)
Hedetniemi, S.M., Hedetniemi, S.T., Liestman, A.L.: A survey of gossiping and broadcasting in communication networks. Networks 18(4), 319–349 (1988)
Tijdeman, R.: On a telephone problem. Nieuw Arch. voor Wiskunde 3(19), 188–192 (1971)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Fujishiro, K., Hasebe, K. (2020). Robustness and Failure Detection in Epistemic Gossip Protocols. In: Lin, SW., Hou, Z., Mahony, B. (eds) Formal Methods and Software Engineering. ICFEM 2020. Lecture Notes in Computer Science(), vol 12531. Springer, Cham. https://doi.org/10.1007/978-3-030-63406-3_2
Download citation
DOI: https://doi.org/10.1007/978-3-030-63406-3_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-63405-6
Online ISBN: 978-3-030-63406-3
eBook Packages: Computer ScienceComputer Science (R0)