Improved periodic data retrieval in asynchronous rings with a faulty host

• Published in: Theoretical computer science Vol. 608; pp. 231 - 254
• Main Authors: Bampas, Evangelos, Leonardos, Nikos, Markou, Euripides, Pagourtzis, Aris, Petrolia, Matoula
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 01.12.2015
• Subjects: Data retrieval; Distributed algorithm; Gray hole; Lower bounds; Malicious host; Mobile agent; Networks; Optimization; Periodic data retrieval; Protocol (computers); Reagents; Red hole; Unreliable whiteboard; Upper bounds; Whiteboards; Red hole; Unreliable whiteboard; Gray hole; Distributed algorithm; Mobile agent; Periodic data retrieval; Malicious host
• ISSN: 0304-3975; 1879-2294
• DOI: 10.1016/j.tcs.2015.09.019

The exploration problem has been extensively studied in unsafe networks containing malicious hosts of a highly harmful nature, called black holes, which completely destroy mobile agents that visit them. In a recent work, Královič and Miklík (SIROCCO 2010, LNCS 6058, pp. 157–167) [20] considered various types of malicious host behavior in the context of the Periodic Data Retrieval problem in asynchronous ring networks with exactly one malicious host. In this problem, a team of initially co-located agents must report data from all safe nodes of the network to the homebase, infinitely often. The malicious host can choose whether to kill visiting agents or allow them to pass through (gray hole). In another variation of the model, the malicious host can, in addition, alter its whiteboard contents in order to deceive visiting agents. The goal is to design a protocol for Periodic Data Retrieval using as few agents as possible. In this paper, we present the first nontrivial lower bounds on the number of agents for Periodic Data Retrieval in asynchronous ring networks. Specifically, we show that at least 4 agents are needed when the malicious host is a gray hole, and at least 5 agents are needed when the malicious host whiteboard is unreliable. This improves the previous lower bound of 3 in both cases and answers an open question posed in the aforementioned paper. On the positive side, we propose an optimal protocol for Periodic Data Retrieval in asynchronous rings with a gray hole, which solves the problem with only 4 agents. This improves the previous upper bound of 9 agents and settles the question of the optimal number of agents in the gray-hole case. Finally, we propose a protocol with 7 agents when the whiteboard of the malicious host is unreliable, significantly improving the previously known upper bound of 27 agents. Along the way, we set forth a detailed framework for studying networks with malicious hosts of varying capabilities.