{"user_id":"11108","publication_identifier":{"isbn":["978-1-4503-5799-9/18/07"]},"abstract":[{"lang":"eng","text":"We study the consensus problem in a synchronous distributed system of n nodes under an adaptive adversary that has a slightly outdated view of the system and can block all incoming and outgoing communication of a constant fraction of the nodes in each round. Motivated by a result of Ben-Or and Bar-Joseph (1998), showing that any consensus algorithm that is resilient against a linear number of crash faults requires $\\tilde \\Omega(\\sqrt n)$ rounds in an n-node network against an adaptive adversary, we consider a late adaptive adversary, who has full knowledge of the network state at the beginning of the previous round and unlimited computational power, but is oblivious to the current state of the nodes. \r\n\r\nOur main contributions are randomized distributed algorithms that achieve consensus with high probability among all except a small constant fraction of the nodes (i.e., \"almost-everywhere'') against a late adaptive adversary who can block up to ε n$ nodes in each round, for a small constant ε >0$. Our first protocol achieves binary almost-everywhere consensus and also guarantees a decision on the majority input value, thus ensuring plurality consensus. We also present an algorithm that achieves the same time complexity for multi-value consensus. Both of our algorithms succeed in $O(log n)$ rounds with high probability, thus showing an exponential gap to the $\\tilde\\Omega(\\sqrt n)$ lower bound of Ben-Or and Bar-Joseph for strongly adaptive crash-failure adversaries, which can be strengthened to $\\Omega(n)$ when allowing the adversary to block nodes instead of permanently crashing them. Our algorithms are scalable to large systems as each node contacts only an (amortized) constant number of peers in each communication round. We show that our algorithms are optimal up to constant (resp.\\ sub-logarithmic) factors by proving that every almost-everywhere consensus protocol takes $\\Omega(log_d n)$ rounds in the worst case, where d is an upper bound on the number of communication requests initiated per node in each round. We complement our theoretical results with an experimental evaluation of the binary almost-everywhere consensus protocol revealing a short convergence time even against an adversary blocking a large fraction of nodes."}],"department":[{"_id":"79"},{"_id":"34"},{"_id":"7"}],"doi":"10.1145/3210377.3210399","language":[{"iso":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"has_accepted_license":"1","publication":"Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","date_created":"2018-07-04T08:55:45Z","author":[{"full_name":"Robinson, Peter","first_name":"Peter","last_name":"Robinson"},{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"},{"full_name":"Setzer, Alexander","first_name":"Alexander","id":"11108","last_name":"Setzer"}],"status":"public","citation":{"apa":"Robinson, P., Scheideler, C., & Setzer, A. (n.d.). Breaking the $\\tilde\\Omega(\\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary. In *Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)*. Wien. https://doi.org/10.1145/3210377.3210399","ama":"Robinson P, Scheideler C, Setzer A. Breaking the $\\tilde\\Omega(\\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary. In: *Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)*. doi:10.1145/3210377.3210399","chicago":"Robinson, Peter, Christian Scheideler, and Alexander Setzer. “Breaking the $\\tilde\\Omega(\\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary.” In *Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)*, n.d. https://doi.org/10.1145/3210377.3210399.","short":"P. Robinson, C. Scheideler, A. Setzer, in: Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), n.d.","bibtex":"@inproceedings{Robinson_Scheideler_Setzer, title={Breaking the $\\tilde\\Omega(\\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary}, DOI={10.1145/3210377.3210399}, booktitle={Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Robinson, Peter and Scheideler, Christian and Setzer, Alexander} }","mla":"Robinson, Peter, et al. “Breaking the $\\tilde\\Omega(\\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary.” *Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)*, doi:10.1145/3210377.3210399.","ieee":"P. Robinson, C. Scheideler, and A. Setzer, “Breaking the $\\tilde\\Omega(\\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary,” in *Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)*, Wien."},"date_updated":"2022-01-06T06:59:16Z","ddc":["040"],"file_date_updated":"2018-10-31T13:30:40Z","conference":{"start_date":"2018-07-16","end_date":"2018-07-18","location":"Wien","name":"30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)"},"title":"Breaking the $\\tilde\\Omega(\\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary","publication_status":"accepted","type":"conference","keyword":["distributed consensus","randomized algorithm","adaptive adversary","complexity lower bound"],"_id":"3422","file":[{"success":1,"access_level":"closed","file_size":1675407,"date_created":"2018-10-31T13:30:40Z","creator":"asetzer","content_type":"application/pdf","file_name":"p173-robinson.pdf","file_id":"5215","date_updated":"2018-10-31T13:30:40Z","relation":"main_file"}],"year":"2018"}