NDLI: Pirogue, a lighter dynamic version of the Raft distributed consensus algorithm

Content Provider	IEEE Xplore Digital Library
Author	Paris, Jehan-Francois Long, Darrell D. E.
Copyright Year	2015
Description	Author affiliation: Department of Computer Science, University of Houston, TX, USA 77204-3010 (Paris, Jehan-Francois) \|\| Department of Computer Science, University of California, Santa Cruz, USA 95064 (Long, Darrell D. E.)
Abstract	Raft is a new distributed consensus algorithm that is easier to understand than the older Paxos algorithm. Raft's major drawback is its high energy footprint: as it relies on static quorums for deciding when it can commit updates, it requires five participants to protect against two simultaneous failures. We propose to reduce this footprint by replacing the static quorums that Raft currently uses by quorums that vary according to the number of currently available participants. We present first a modified dynamic-linear voting protocol that disables single-server updates and show that a Raft cluster with four participants managed by this protocol would be almost as available as a conventional Raft cluster with five participants and always tolerate the irrecoverable failure of any single participant without any data loss. In addition, we show a Raft cluster with three participants and a witness managed by an unmodified dynamic-linear voting protocol would be more available than a conventional Raft cluster with five participants and could still tolerate most irrecoverable failures of any single participant while maintaining recoverability.
Starting Page	1
Ending Page	8
File Size	293963
Page Count	8
File Format	PDF
ISSN	23749628
e-ISBN	9781467385909
DOI	10.1109/PCCC.2015.7410281
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2015-12-14
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Servers Nominations and elections Protocols Clustering algorithms Algorithm design and analysis Heuristic algorithms Peer-to-peer computing Raft algorithm Distributed computing Fault-tolerant computing Green computing Distributed consensus
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Reducing the Energy Footprint of a Distributed Consensus Algorithm

Pirogue, a Lighter Dynamic Version of the Raft Distributed Consensus Algorithm

An empirical study of a scalable Byzantine agreement algorithm

Leader Election in Sparse Dynamic Networks with Churn

Gossip-based spectral clustering of distributed data streams

Dynamic and fault-tolerant cluster management

Intrusion-Tolerant Shared Memory through a P2P Overlay Segmentation

Towards Secure and Scalable Computation in Peer-to-Peer Networks

A Generalized Clustering Algorithm for Dynamic Wireless Sensor Networks

Pirogue, a lighter dynamic version of the Raft distributed consensus algorithm

Similar Documents

Reducing the Energy Footprint of a Distributed Consensus Algorithm

Pirogue, a Lighter Dynamic Version of the Raft Distributed Consensus Algorithm

An empirical study of a scalable Byzantine agreement algorithm

Leader Election in Sparse Dynamic Networks with Churn

Gossip-based spectral clustering of distributed data streams

Dynamic and fault-tolerant cluster management

Intrusion-Tolerant Shared Memory through a P2P Overlay Segmentation

Towards Secure and Scalable Computation in Peer-to-Peer Networks

A Generalized Clustering Algorithm for Dynamic Wireless Sensor Networks

Pirogue, a lighter dynamic version of the Raft distributed consensus algorithm