Abstract
This paper investigates an open problem introduced in Dieudonné et al. (ACM Trans Algorithms 11(1):1, 2014). Two or more mobile agents start from nodes of a network and have to accomplish the task of gathering which consists in getting all together at the same node at the same time. An adversary chooses the initial nodes of the agents and assigns a different positive integer (called label) to each of them. Initially, each agent knows its label but does not know the labels of the other agents or their positions relative to its own. Agents move in synchronous rounds and can communicate with each other only when located at the same node. Up to f of the agents are Byzantine. A Byzantine agent can choose an arbitrary port when it moves, can convey arbitrary information to other agents and can change its label in every round, in particular by forging the label of another agent or by creating a completely new one. What is the minimum number \({\mathcal {M}}\) of good agents that guarantees deterministic gathering of all of them, with termination? We provide exact answers to this open problem by considering the case when the agents initially know the size of the network and the case when they do not. In the former case, we prove \({\mathcal {M}}=f+1\) while in the latter, we prove \({\mathcal {M}}=f+2\). More precisely, for networks of known size, we design a deterministic algorithm gathering all good agents in any network provided that the number of good agents is at least \(f+1\). For networks of unknown size, we also design a deterministic algorithm ensuring the gathering of all good agents in any network but provided that the number of good agents is at least \(f+2\). Both of our algorithms are optimal in terms of required number of good agents, as each of them perfectly matches the respective lower bound on \({\mathcal {M}}\) shown in Dieudonné et al. (2014), which is of \(f+1\) when the size of the network is known and of \(f+2\) when it is unknown. Perhaps surprisingly, our results highlight an interesting feature when put in perspective with known results concerning a relaxed variant of this problem in which the Byzantine agents cannot change their initial labels. Indeed under this variant \({\mathcal {M}}=1\) for networks of known size and \({\mathcal {M}}=f+2\) for networks of unknown size. Following this perspective, it turns out that when the size of the network is known, the ability for the Byzantine agents to change their labels significantly impacts the value of \({\mathcal {M}}\). However, the relevance for \({\mathcal {M}}\) of such an ability completely disappears in the most general case where the size of the network is unknown, as \({\mathcal {M}}=f+2\) regardless of whether Byzantine agents can change their labels or not.
Similar content being viewed by others
Notes
The proof that both of these values are enough, under their respective assumptions regarding the knowledge of the network size, relies on algorithms using a mechanism of blacklists that are, informally speaking, lists of labels corresponding to agents having exhibited an “inconsistent” behavior. Of course, in the context of our paper, we cannot use such blacklists as the Byzantine agents can change their labels and in particular steal the identities of good agents.
References
Agmon, N., Peleg, D.: Fault-tolerant gathering algorithms for autonomous mobile robots. SIAM J. Comput. 36(1), 56–82 (2006)
Alpern, S.: Rendezvous search: a personal perspective. Oper. Res. 50(5), 772–795 (2002)
Alpern, S.: The theory of search games and rendezvous. In: Hillier, F.S. (ed.) International Series in Operations Research and Management Science. Kluwer Academic Publishers, Dordrecht (2003)
Bampas, E., Czyzowicz, J., Gasieniec, L., Ilcinkas, D., Labourel, A.: Almost optimal asynchronous rendezvous in infinite multidimensional grids. In: Proceedings 2010 24th International Symposium Distributed Computing, DISC 2010, pp. 297–311. Cambridge (13–15 Sept 2010)
Barborak, M., Malek, M.: The consensus problem in fault-tolerant computing. ACM Comput. Surv. 25(2), 171–220 (1993)
Chalopin, J., Das, S., Kosowski, A.: Constructing a map of an anonymous graph: applications of universal sequences. In: Proceedings 2010 14th International Conference Principles of Distributed Systems, OPODIS 2010, pp. 119–134, Tozeur (14–17 Dec 2010)
Cieliebak, M., Flocchini, P., Prencipe, G., Santoro, N.: Distributed computing by mobile robots: gathering. SIAM J. Comput. 41(4), 829–879 (2012)
Collins, A., Czyzowicz, J., Gasieniec, L., Labourel, A.: Tell me where I am so I can meet you sooner. In: 37th International Colloquium 2010 Proceedings, Part II Automata, Languages and Programming, ICALP 2010, pp. 502–514, Bordeaux (6–10 July 2010)
Czyzowicz, J., Kosowski, A., Pelc, A.: How to meet when you forget: log-space rendezvous in arbitrary graphs. Distrib. Comput. 25(2), 165–178 (2012)
Czyzowicz, J., Pelc, A., Labourel, A.: How to meet asynchronously (almost) everywhere. ACM Trans. Algorithms 8(4), 37 (2012)
Das, S., Dereniowski, D., Kosowski, A., Uznanski, P.: Rendezvous of distance-aware mobile agents in unknown graphs. In: 21st International Colloquium Proceedings 2014 Structural Information and Communication Complexity, SIROCCO 2014, pp. 295–310, Takayama (23–25 July 2014)
Défago, X., Gradinariu, M., Messika, S., Raipin Parvédy, P.: Fault-tolerant and self-stabilizing mobile robots gathering. In: Proceedings 20th International Symposium Distributed Computing, DISC 2006, Stockholm, pp. 46–60 (18–20 Sept 2006)
De Marco, G., Gargano, L., Kranakis, E., Krizanc, D., Pelc, A., Vaccaro, U.: Asynchronous deterministic rendezvous in graphs. Theor. Comput. Sci. 355(3), 315–326 (2006)
Dessmark, A., Fraigniaud, P., Kowalski, D.R., Pelc, A.: Deterministic rendezvous in graphs. Algorithmica 46(1), 69–96 (2006)
Dieudonné, Y., Pelc, A.: Anonymous meeting in networks. Algorithmica 74(2), 908–946 (2016)
Dieudonné, Y., Pelc, A., Peleg, D.: Gathering despite mischief. ACM Trans. Algorithms 11(1), 1 (2014)
Dieudonné, Y., Pelc, A., Villain, V.: How to meet asynchronously at polynomial cost. SIAM J. Comput. 44(3), 844–867 (2015)
Fraigniaud, P., Pelc, A.: Deterministic rendezvous in trees with little memory. In: 2008. Proceedings 22nd International Symposium Distributed Computing, DISC 2008, Arcachon, pp. 242–256 (22–24 Sept 2008)
Fraigniaud, P., Pelc, A.: Delays induce an exponential memory gap for rendezvous in trees. ACM Trans. Algorithms 9(2), 17 (2013)
Guilbault, S., Pelc, A.: Gathering asynchronous oblivious agents with local vision in regular bipartite graphs. Theor. Comput. Sci. 509, 86–96 (2013)
Izumi, T., Souissi, S., Katayama, Y., Inuzuka, N., Défago, Xavier, Wada, Koichi, Yamashita, Masafumi: The gathering problem for two oblivious robots with unreliable compasses. SIAM J. Comput. 41(1), 26–46 (2012)
Kowalski, D.R., Malinowski, A.: How to meet in anonymous network. Theor. Comput. Sci. 399(1–2), 141–156 (2008)
Kranakis, E., Krizanc, D., Rajsbaum, S.: Mobile agent rendezvous: a survey. In: 2006, Proceedings 13th International Colloquium Structural Information and Communication Complexity, SIROCCO 2006, Chester, pp. 1–9 (2–5 July 2006)
Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, Burlington (1996)
Miller, A., Pelc, A.: Fast rendezvous with advice. In: 10th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, Algorithms for Sensor Systems ALGOSENSORS 2014, Wroclaw, pp. 75–87, Revised Selected Papers (12 Sept 2014)
Miller, A., Pelc, A.: Time versus cost tradeoffs for deterministic rendezvous in networks. In: ACM Symposium on Principles of Distributed Computing, PODC ’14, Paris, pp. 282–290 (15–18 July 2014)
Pease, M.C., Shostak, R.E., Lamport, L.: Reaching agreement in the presence of faults. J. ACM 27(2), 228–234 (1980)
Reingold, O.: Undirected connectivity in log-space. J. ACM 55(4), 17 (2008)
Schelling, T.: The Strategy of Conflict. Oxford University Press, Oxford (1960)
Ta-Shma, A., Zwick, U.: Deterministic rendezvous, treasure hunts, and strongly universal exploration sequences. ACM Trans. Algorithms 10(3), 12 (2014)
Author information
Authors and Affiliations
Corresponding author
Additional information
A preliminary version of this paper appeared in Proc. 22nd International Colloquium on Structural Information and Communication Complexity (SIROCCO 2015), July 2015, Montserrat, Spain, 179–193. Supported by the European Regional Development Fund (ERDF) and the Picardy region under Project TOREDY.
Rights and permissions
About this article
Cite this article
Bouchard, S., Dieudonné, Y. & Ducourthial, B. Byzantine gathering in networks. Distrib. Comput. 29, 435–457 (2016). https://doi.org/10.1007/s00446-016-0276-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00446-016-0276-9