Ashish Saxena
ABSTRACT
The 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 start-up delays, i.e., the good agents may not wake up at the same time. Hirose et al. come up with an algorithm considering start-up delays that use a strong team of at least 4f2 + 8f + 4 many good agents but runs much faster than that of Dieudonné et al.. Later Hirose et al. provide another polynomial time algorithm for gathering in the presence of at least 8f + 8 good agents. However, this algorithm does not work in the presence of start-up delays, also simultaneous termination of good agents is not possible. We, in this work, provide an algorithm considering start-up delays of the good agents reducing the number of good agents w.r.t. Hirose et al. from 4f2 + 8f + 4 to f2 + 4f + 9. Also, our algorithm guarantees simultaneous termination of the good agents.
- Steve Alpern and Shmuel Gal. 2003. The theory of search games and rendezvous. International series in operations research and management science, Vol. 55. Kluwer.Google Scholar
- Edward J. Anderson and Sándor P. Fekete. 1998. Asymmetric Rendezvous on the Plane. In Proceedings of the Fourteenth Annual Symposium on Computational Geometry (Minneapolis, Minnesota, USA) (SCG ’98). Association for Computing Machinery, New York, NY, USA, 365–373. https://doi.org/10.1145/276884.276925Google ScholarDigital Library
- Sébastien Bouchard, Yoann Dieudonné, and Bertrand Ducourthial. 2016. Byzantine Gathering in Networks. Distrib. Comput. 29 (2016), 435–457.Google ScholarDigital Library
- Sébastien Bouchard, Yoann Dieudonné, and Anissa Lamani. 2022. Byzantine Gathering in Polynomial Time. Distrib. Comput. 35 (2022), 235–263.Google ScholarDigital Library
- Mark Cieliebak, Paola Flocchini, Giuseppe Prencipe, and Nicola Santoro. 2003. Solving the Robots Gathering Problem. In Automata, Languages and Programming, Jos C. M. Baeten, Jan Karel Lenstra, Joachim Parrow, and Gerhard J. Woeginger (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 1181–1196.Google Scholar
- Reuven Cohen and David Peleg. 2005. Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems. SIAM J. Comput. 34, 6 (2005), 1516–1528.Google ScholarDigital Library
- Jurek Czyzowicz, Andrzej Pelc, and Arnaud Labourel. 2012. How to meet asynchronously (almost) everywhere. ACM Trans. Algorithms 8, 4 (2012), 37:1–37:14.Google ScholarDigital Library
- Anders Dessmark, Pierre Fraigniaud, Dariusz R. Kowalski, and Andrzej Pelc. 2006. Deterministic Rendezvous in Graphs. Algorithmica 46, 1 (2006), 69–96.Google ScholarCross Ref
- Yoann Dieudonné, Andrzej Pelc, and David Peleg. 2014. Gathering Despite Mischief. ACM Trans. Algorithms 11 (2014), 28 pages.Google ScholarDigital Library
- R. Weber E. Anderson. 1990. The rendezvous problem on discrete locations. Journal of Applied Probability 28 (1990), 839–851.Google ScholarCross Ref
- Sándor P. Fekete Edward J. Anderson. 2001. Two Dimensional Rendezvous Search. Operation Research 49 (2001), 107–118.Google ScholarDigital Library
- Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, and Peter Widmayer. 2005. Gathering of asynchronous robots with limited visibility. Theoretical Computer Science 337, 1 (2005), 147–168.Google ScholarDigital Library
- Paola Flocchini, Giuseppe Prencipe, Nicola Santoro, and Peter Widmayer. 2005. Gathering of asynchronous robots with limited visibility. Theoretical Computer Science 337, 1 (2005), 147–168. https://doi.org/10.1016/j.tcs.2005.01.001Google ScholarDigital Library
- Jion Hirose, Junya Nakamura, Fukuhito Ooshita, and Michiko Inoue. 2021. Gathering with a Strong Team in Weakly Byzantine Environments. In Proceedings of the 22nd International Conference on Distributed Computing and Networking (Nara, Japan) (ICDCN ’21). Association for Computing Machinery, New York, NY, USA, 26–35. https://doi.org/10.1145/3427796.3427799Google ScholarDigital Library
- Jion Hirose, Junya Nakamura, Fukuhito Ooshita, and Michiko Inoue. 2022. Brief Announcement: Gathering Despite a Linear Number of Weakly Byzantine Agents. In Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing (Salerno, Italy) (PODC’22). Association for Computing Machinery, New York, NY, USA, 375–377. https://doi.org/10.1145/3519270.3538470Google ScholarDigital Library
- Amos Israeli and Marc Jalfon. 1990. Token Management Schemes and Random Walks Yield Self-Stabilizing Mutual Exclusion. In Proceedings of the Ninth Annual ACM Symposium on Principles of Distributed Computing (Quebec City, Quebec, Canada) (PODC ’90). Association for Computing Machinery, New York, NY, USA, 119–131. https://doi.org/10.1145/93385.93409Google ScholarDigital Library
- Dariusz R. Kowalski and Adam Malinowski. 2008. How to meet in anonymous network. Theoretical Computer Science 399, 1 (2008), 141–156.Google ScholarDigital Library
- W. Lim and S. Alpern. 1996. Minimax rendezvous on the line. SIAM Journal on Control and Optimization 34 (1996), 1650–1665.Google ScholarDigital Library
- Gianluca De Marco, Luisa Gargano, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc, and Ugo Vaccaro. 2006. Asynchronous deterministic rendezvous in graphs. Theor. Comput. Sci. 355, 3 (2006), 315–326.Google ScholarDigital Library
- Avery Miller and Ullash Saha. 2020. Fast Byzantine Gathering with Visibility in Graphs. In Algorithms for Sensor Systems, Cristina M. Pinotti, Alfredo Navarra, and Amitabha Bagchi (Eds.). Springer International Publishing, Cham, 140–153.Google Scholar
- Andrzej Pelc. 2012. Deterministic rendezvous in networks: A comprehensive survey. Networks 59, 3 (2012), 331–347.Google ScholarDigital Library
- Andrzej Pelc. 2018. Deterministic gathering with crash faults. Networks 72, 2 (2018), 182–199.Google ScholarCross Ref
- Omer Reingold. 2008. Undirected connectivity in log-space. J. ACM 55, 4 (2008), 17:1–17:24.Google ScholarDigital Library
- Thomas S. Schelling. 1960. The strategy of conflict. Vol. 55. Oxford University Press, Oxford.Google Scholar
- Amnon Ta-Shma and Uri Zwick. 2014. Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences. ACM Trans. Algorithms 10 (2014), 15 pages.Google ScholarDigital Library
- L. Thomas. 1992. Finding your kids when they are lost. Journal of the Operational Research Society 43 (1992), 637–639.Google ScholarCross Ref
- Masashi TSUCHIDA, Fukuhito OOSHITA, and Michiko INOUE. 2018. Byzantine-Tolerant Gathering of Mobile Agents in Arbitrary Networks with Authenticated Whiteboards. IEICE Transactions on Information and Systems E101.D, 3 (2018), 602–610.Google Scholar
- Masashi Tsuchida, Fukuhito Ooshita, and Michiko Inoue. 2019. Gathering of Mobile Agents in Asynchronous Byzantine Environments with Authenticated Whiteboards. In Networked Systems, Andreas Podelski and François Taïani (Eds.). Springer International Publishing, Cham, 85–99.Google Scholar
- S. Gal V. Baston. 1998. Rendezvous on the line when the players’ initial distance is given by an unknown probability distribution. SIAM Journal on Control and Optimization 36 (1998), 1880–1889.Google ScholarDigital Library
- S. Gal V. Baston. 2001. Rendezvous search when marks are left at the starting points. Naval Research Logistics 48 (2001), 722–731.Google ScholarCross Ref
Index Terms
- A Further Study on Weak Byzantine Gathering of Mobile Agents
Recommendations
Brief Announcement: Gathering Despite a Linear Number of Weakly Byzantine Agents
PODC'22: Proceedings of the 2022 ACM Symposium on Principles of Distributed ComputingWe 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 ...
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 ...
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