DeepAI AI Chat
Log In Sign Up

A Hierarchical Model for Fast Distributed Consensus in Dynamic Networks

by   Timothy Castiglia, et al.
Rensselaer Polytechnic Institute

We present two new consensus algorithms for dynamic networks. The first, Fast Raft, is a variation on the Raft consensus algorithm that reduces the number of message rounds in typical operation. Fast Raft is ideal for fast-paced distributed systems where membership changes over time and where sites must reach consensus quickly. The second, C-Raft, is targeted for distributed systems where sites are grouped into clusters, with fast communication within clusters and slower communication between clusters. C-Raft uses Fast Raft as a building block and defines a hierarchical model of consensus to improve upon throughput in globally distributed systems. We prove the safety and liveness properties of each algorithm. Finally, we present an experimental evaluation of both algorithms in AWS.


page 1

page 2

page 3

page 4


A Generalised Solution to Distributed Consensus

Distributed consensus, the ability to reach agreement in the face of fai...

Analysis of LFT2

For a decentralized and transparent society, blockchain technology has b...

Blockmania: from Block DAGs to Consensus

Blockmania is a byzantine consensus protocol. Nodes emit blocks forming ...

Time Complexity of Consensus in Dynamic Networks Under Oblivious Message Adversaries

Consensus is a most fundamental task in distributed computing. This pape...

The Problem of Distributed Consensus: A Survey

A survey is given of approaches to the problem of distributed consensus,...

Lecture Notes on Leader-based Sequence Paxos – An Understandable Sequence Consensus Algorithm

Agreement among a set of processes and in the presence of partial failur...

Distributed Computation of Wasserstein Barycenters over Networks

We propose a new class-optimal algorithm for the distributed computation...