Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/byzantine-gathering-in-polynomial-time-9WxnL6dSnp
References (45)
-
G. Marco, L. Gargano, E. Kranakis, D. Krizanc, A. Pelc, U. Vaccaro (2005)
Asynchronous Deterministic Rendezvous in Graphs -
S. Bouchard, Yoann Dieudonné, B. Ducourthial (2015)
Byzantine gathering in networksDistributed Computing, 29
-
Andrew Collins, J. Czyzowicz, L. Gąsieniec, Arnaud Labourel (2010)
Tell Me Where I Am So I Can Meet You Sooner -
P. Fraigniaud, A. Pelc (2008)
Deterministic Rendezvous in Trees with Little Memory -
Omer Reingold (2008)
Undirected connectivity in log-spaceJ. ACM, 55
-
Taisuke Izumi, S. Souissi, Y. Katayama, Nobuhiro Inuzuka, X. Défago, K. Wada, M. Yamashita (2011)
The Gathering Problem for Two Oblivious Robots with Unreliable CompassesArXiv, abs/1111.1492
-
P. Fraigniaud, C. Gavoille, D. Ilcinkas, A. Pelc (2007)
Distributed computing with advice: information sensitivity of graph coloringDistributed Computing, 21
-
P. Fraigniaud, A. Pelc (2011)
Delays Induce an Exponential Memory Gap for Rendezvous in TreesArXiv, abs/1102.0467
-
N. Nisse, David Soguet (2007)
Graph searching with adviceTheor. Comput. Sci., 410
-
E. Kranakis, D. Krizanc, S. Rajsbaum (2006)
Mobile Agent Rendezvous: A Survey -
Michal Katz, Nir Katz, Amos Korman, D. Peleg (2002)
Labeling schemes for flow and connectivity -
Samuel Guilbault, A. Pelc (2011)
Gathering asynchronous oblivious agents with local vision in regular bipartite graphs -
P. Fraigniaud, D. Ilcinkas, A. Pelc (2008)
Tree exploration with adviceInf. Comput., 206
-
Avery Miller, A. Pelc (2014)
Time versus cost tradeoffs for deterministic rendezvous in networksDistributed Computing, 29
-
Yoann Dieudonné, A. Pelc, V. Villain (2013)
How to meet asynchronously at polynomial costSIAM J. Comput., 44
-
M. Thorup, Uri Zwick (2001)
Approximate distance oracles -
Masashi Tsuchida, Fukuhito Ooshita, M. Inoue (2018)
Byzantine-Tolerant Gathering of Mobile Agents in Arbitrary Networks with Authenticated WhiteboardsIEICE Trans. Inf. Syst., 101-D
-
E. Kranakis, D. Krizanc, Euripides Markou, Aris Pagourtzis, Felipe Ramírez (2017)
Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs -
S. Abiteboul, Haim Kaplan, T. Milo (2001)
Compact labeling schemes for ancestor queries -
GD Marco, L Gargano, E Kranakis, D Krizanc, A Pelc, U Vaccaro (2006)
Asynchronous deterministic rendezvous in graphsTheor. Comput. Sci., 355
-
S. Das, D. Dereniowski, A. Kosowski, P. Uznański (2014)
Rendezvous of Distance-aware Mobile Agents in Unknown Graphs -
Avery Miller, A. Pelc (2014)
Fast rendezvous with adviceTheor. Comput. Sci., 608
-
S. Alpern (2002)
Rendezvous Search: A Personal PerspectiveOper. Res., 50
-
Avery Miller, Ullash Saha (2020)
Fast Byzantine Gathering with Visibility in Graphs -
M. Pease, R. Shostak, L. Lamport (1980)
Reaching Agreement in the Presence of FaultsJ. ACM, 27
-
M. Barborak, M. Malek (1993)
The consensus problem in fault-tolerant computingACM Comput. Surv., 25
-
Reuven Cohen, P. Fraigniaud, D. Ilcinkas, Amos Korman, D. Peleg (2005)
Label-guided graph exploration by a finite automaton -
Yoann Dieudonné, A. Pelc, D. Peleg (2012)
Gathering Despite MischiefACM Transactions on Algorithms (TALG), 11
-
D. Kowalski, Adam Malinowski (2006)
How to meet in anonymous network -
Noam Agmon, D. Peleg (2004)
Fault-tolerant gathering algorithms for autonomous mobile robotsSIAM J. Comput., 36
-
A. Pelc (2017)
Deterministic gathering with crash faultsNetworks, 72
-
Anders Dessmark, P. Fraigniaud, D. Kowalski, A. Pelc (2003)
Deterministic Rendezvous in GraphsAlgorithmica, 46
-
A. Rapoport, T. Schelling (1961)
The Strategy of Conflict.Journal of the American Statistical Association, 56
-
Jion Hirose, Junya Nakamura, Fukuhito Ooshita, M. Inoue (2020)
Gathering with a strong team in weakly Byzantine environmentsProceedings of the 22nd International Conference on Distributed Computing and Networking
-
X. Défago, M. Potop-Butucaru, Stéphane Messika, Philippe Parvédy (2006)
Fault-Tolerant and Self-stabilizing Mobile Robots Gathering -
J. Czyzowicz, Konstantinos Georgiou, E. Kranakis, D. Krizanc, L. Narayanan, J. Opatrny, S. Shende (2016)
Search on a Line by Byzantine Robots -
Seif Haridi (1992)
Distributed Algorithms, 647
-
Nir Katz, Amos Korman, D. Peleg (2007)
Labeling schemes for ow and connectivityMichal -
E. Bampas, J. Czyzowicz, L. Gąsieniec, D. Ilcinkas, Arnaud Labourel (2010)
Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids -
J. Czyzowicz, A. Kosowski, A. Pelc (2010)
How to meet when you forget: log-space rendezvous in arbitrary graphsDistributed Computing, 25
-
Mark Cieliebak, P. Flocchini, G. Prencipe, N. Santoro (2012)
Distributed Computing by Mobile Robots: GatheringSIAM J. Comput., 41
-
S. Alpern, S. Gal (2002)
The theory of search games and rendezvous, 55
-
J. Czyzowicz, Arnaud Labourel, A. Pelc (2010)
How to meet asynchronously (almost) everywhereArXiv, abs/1001.0890
-
A. Ta-Shma, Uri Zwick (2007)
Deterministic rendezvous, treasure hunts and strongly universal exploration sequencesACM Trans. Algorithms, 10
-
Publisher's Note Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations
- Publisher
- Springer Journals
- Copyright
- Copyright © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2022
- ISSN
- 0178-2770
- eISSN
- 1432-0452
- DOI
- 10.1007/s00446-022-00419-9
- Publisher site
- See Article on Publisher Site
Abstract
Gathering is a key task in distributed and mobile systems, which becomes significantly harder if some agents are subject to Byzantine faults, known as being the worst ones. We propose here to study the task of Byzantine gathering in an arbitrary graph: despite the presence of Byzantine agents, the goal is to ensure that all the other (good) agents, executing the same algorithm, eventually meet at the same node and stop. Initially, each agent gets as input a different label and some global knowledge that is common to all agents. The agents move in synchronous rounds and communicate with each other only when located at the same node. There are f Byzantine agents. These agents act in an unpredictable way, e.g., they may convey arbitrary informations or forge any label. In the literature, the gathering algorithms working in such a context all have an exponential time complexity in the number n of nodes and the labels of the good agents. In this paper, we design a deterministic algorithm to solve Byzantine gathering in time polynomial in n and the logarithm ℓ\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$\ell $$\end{document} of the smallest label of a good agent, provided the agents are a strong team i.e., a team where the number of good agents is at least some quadratic polynomial in f. Our algorithm requires global knowledge that can be coded in O(logloglogn)\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$O(\log \log \log n)$$\end{document} bits: we prove this size is of optimal order of magnitude to obtain a polynomial time complexity in n and ℓ\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$\ell $$\end{document} with strong teams.
Journal
Distributed Computing – Springer Journals
Published: Jun 1, 2022
Keywords: Gathering; Deterministic algorithm; Mobile agent; Byzantine fault; Polynomial time