Brief Announcement: Gathering Despite a Linear Number of Weakly Byzantine Agents
Pages 375 - 377
Abstract
We study the gathering problem to make multiple agents initially scattered in arbitrary networks gather at a single node. There exist k agents with unique identifiers (IDs) in the network, and f of them are weakly Byzantine agents, which behave arbitrarily except for falsifying their IDs. The agents behave in synchronous rounds, and each node does not have any memory like a whiteboard. In the literature, there exists a gathering algorithm that tolerates any number of Byzantine agents, while the fastest gathering algorithm requires Ω( f 2) non-Byzantine agents.
Supplementary Material
BA presentation video
- Download
- 232.26 MB
References
[1]
Anders Dessmark, Pierre Fraigniaud, Dariusz R. Kowalski, and Andrzej Pelc. 2006. Deterministic Rendezvous in Graphs. Algorithmica 46, 1 (2006), 69--96.
[2]
Yoann Dieudonné, Andrzej Pelc, and David Peleg. 2014. Gathering Despite Mischief. ACM Transactions on Algorithms 11, 1 (2014), 1--28.
[3]
Jion Hirose, Junya Nakamura, Fukuhito Ooshita, and Michiko Inoue. 2022. Gathering despite a linear number of weakly Byzantine agents. (2022). arXiv:2205.14937 [cs.DC]
[4]
Jion Hirose, Junya Nakamura, Fukuhito Ooshita, and Michiko Inoue. 2022. Weakly Byzantine Gathering with a Strong Team. IEICE TRANSACTIONS on Information and Systems 105, 3 (2022), 541--555.
[5]
Pankaj Khanchandani and Roger Wattenhofer. 2021. Byzantine Agreement with Unknown Participants and Failures. In 35th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2021. IEEE, 952--961.
[6]
Andrzej Pelc. 2019. Deterministic Rendezvous Algorithms. In Distributed Computing by Mobile Entities, Current Research in Moving and Computing, Paola Flocchini, Giuseppe Prencipe, and Nicola Santoro (Eds.). Springer, 423--454.
[7]
Amnon Ta-Shma and Uri Zwick. 2014. Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences. ACM Transactions on Algorithms 10, 3 (2014), 12:1--12:15.
Index Terms
- Brief Announcement: Gathering Despite a Linear Number of Weakly Byzantine Agents
Recommendations
Gathering with a strong team in weakly Byzantine environments
ICDCN '21: Proceedings of the 22nd International Conference on Distributed Computing and NetworkingWe study the gathering problem requiring a team of mobile agents to gather at a single node in arbitrary networks. The team consists of k agents with unique identifiers (IDs), and f of them are weakly Byzantine agents, which behave arbitrarily except ...
A Further Study on Weak Byzantine Gathering of Mobile Agents
ICDCN '24: Proceedings of the 25th International Conference on Distributed Computing and NetworkingThe gathering of mobile agents in the presence of Byzantine faults is first studied by Dieudonné et al.. Authors provide a polynomial time algorithm handling any number of weak Byzantine agents in the presence of at least one good agent considering ...
Byzantine gathering in polynomial time
AbstractGathering 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 ...
Comments
Information & Contributors
Information
Published In
July 2022
509 pages
Copyright © 2022 Owner/Author.
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 21 July 2022
Check for updates
Author Tags
Qualifiers
- Extended-abstract
Funding Sources
- Japan Science and Technology Agency
- Japan Society for the Promotion of Science
Conference
Acceptance Rates
Overall Acceptance Rate 740 of 2,477 submissions, 30%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 118Total Downloads
- Downloads (Last 12 months)50
- Downloads (Last 6 weeks)11
Reflects downloads up to 22 Sep 2024
Other Metrics
Citations
Cited By
View allView Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in