Baxos: Backing off for Robust and Efficient Consensus
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909435238023168 |
|---|---|
| author | Tennage, Pasindu Basescu, Cristina Kogias, Eleftherios Kokoris Syta, Ewa Jovanovic, Philipp Ford, Bryan |
| author_facet | Tennage, Pasindu Basescu, Cristina Kogias, Eleftherios Kokoris Syta, Ewa Jovanovic, Philipp Ford, Bryan |
| contents | Leader-based consensus algorithms are vulnerable to liveness and performance downgrade attacks. We explore the possibility of replacing leader election in Multi-Paxos with random exponential backoff (REB), a simpler approach that requires minimum modifications to the two phase Synod Paxos and achieves better resiliency under attacks. We propose Baxos, a new resilient consensus protocol that leverages a random exponential backoff scheme as a replacement for leader election in consensus algorithms. Our backoff scheme addresses the common challenges of random exponential backoff such as scalability and robustness to changing wide area latency. We extensively evaluate Baxos to illustrate its performance and robustness against two liveness and performance downgrade attacks using an implementation running on Amazon EC2 in a wide area network and a combination of a micro benchmark and YCSB-A workload on Redis. Our results show that Baxos offers more robustness to liveness and performance downgrade attacks than leader-based consensus protocols. Baxos outperforms Multi-Paxos and Raft up to 128% in throughput under liveness and performance downgrade attacks under worst case contention scenarios where each replica proposes requests concurrently. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2204_10934 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Baxos: Backing off for Robust and Efficient Consensus Tennage, Pasindu Basescu, Cristina Kogias, Eleftherios Kokoris Syta, Ewa Jovanovic, Philipp Ford, Bryan Distributed, Parallel, and Cluster Computing C.5.0; C.4.1 Leader-based consensus algorithms are vulnerable to liveness and performance downgrade attacks. We explore the possibility of replacing leader election in Multi-Paxos with random exponential backoff (REB), a simpler approach that requires minimum modifications to the two phase Synod Paxos and achieves better resiliency under attacks. We propose Baxos, a new resilient consensus protocol that leverages a random exponential backoff scheme as a replacement for leader election in consensus algorithms. Our backoff scheme addresses the common challenges of random exponential backoff such as scalability and robustness to changing wide area latency. We extensively evaluate Baxos to illustrate its performance and robustness against two liveness and performance downgrade attacks using an implementation running on Amazon EC2 in a wide area network and a combination of a micro benchmark and YCSB-A workload on Redis. Our results show that Baxos offers more robustness to liveness and performance downgrade attacks than leader-based consensus protocols. Baxos outperforms Multi-Paxos and Raft up to 128% in throughput under liveness and performance downgrade attacks under worst case contention scenarios where each replica proposes requests concurrently. |
| title | Baxos: Backing off for Robust and Efficient Consensus |
| topic | Distributed, Parallel, and Cluster Computing C.5.0; C.4.1 |
| url | https://arxiv.org/abs/2204.10934 |