Analysis of Raft Consensus Algorithm

T. Srajan Kumar; V. Indrani; D. Swaroopa

Abstract

Raft Consensus is an algorithm designed as an update to paxos. It was proposed in a way such that it is more understandable than paxos by means of separation of states, but it also formally proven protected and carries some additional features. Raft approach for distributed consensus by a leader in which cluster has one and only elected leader which is fully responsible for managing log value on the other servers of the cluster. It means that the leader has privilege to decide on new entries placement and establishment of data flow between it and the other servers without consulting. Raft provides a universal way to share nodes across a cluster of computing systems, ensuring that every node in the cluster set upon the same series of transaction.

Keywords

Consensus, Data Communication, Distributed System, Paxos

Reference

[1] Bolosky, W. J., Bradshaw, D., Haagens, R. B., Kusters, N. P., and LI, P .Paxos Replicated State Machines as the Basis of a High-Performance Data Store. In Proc. NSDI’11, USENIX Conference on Networked Systems Design and Implementation (2011), USENIX, pp. 141–154.

[2] Burrows, M. The Chubby lock service for loosely coupled distributed systems. In Proc. OSDI’06, Symposium on Operating Systems Design and Implementation (2006), USENIX, pp. 335–350.

[3] Camargos, L. J., schmidt, R. M., and pedone, F.Multicoordinated Paxos.

[4] In Proc. PODC’07, ACM Symposium on Principles of Distributed Computing (2007), ACM, pp. 316–317. Chandra, T. D., Griesemer, R., and Redstone, J. Poxos made live: an engineering perspective. In Proc. PODC’07, ACM Symposium on Principles of Distributed Computing (2007), ACM, pp. 398–407.

[5] Chang, F., Dean, J., Ghemawat, S., Hsieh, W. C., Wallach, D. A.,B, M., Chandra, T., Fikes, A., and Gruber, R. E. Big table: a Distributed Storage System for Structured Data. InProc. OSDI’06, USENIX Symposium on Operating Systems Design and Implementation (2006), USENIX, pp. 205–218.

[6] Corbett, J. C., dean, J., Epstein, M., Fikes, A., Frost, C., Furman, J. J., Ghemawat, S., Gubarev, A., Heiser, C., Hochschild, P., Hsieh, W., KKanthak, S., Kogan, E., Li, H., Lloyd, A., Melnik, S., Mwaura, D., Nagle, D., Quinlan, S., Rao, R., Rolig, L., Saito, Y., Szymaniak, M., Taylor, C., Wang, R., and Woodford, D. Spanner: Google’s Globallydistributed database. In Proc. OSDI’12, USENIX Conference on Operating Systems Design and Implementation (2012), USENIX, pp. 251–264.

[7] Ghemawat, S., Gobioff, H., and Leung, S.-T. The Google file system. In Proc. SOSP’03, ACM Symposium on Operating Systems Principles (2003), ACM, pp. 29–43.

[8] Gray, C., and Cheriton, D. Leases: An efficient fault tolerant mechanism for distributed file cache consistency. In Proceedings of the 12th ACM symposium on Operating Systems Principles (1989), pp. 202–210.

[9] Lamport, L. Time, clocks, and the ordering of events in a distributed system. Commununications of the ACM 21, 7 (July 1978), 558–565.

[10] Lampson, B. W. How to build a highly available system using consensus. In Distributed Algorithms, O. Baboaglu and K. Marzullo, Eds. Springer-Verlag, 1996, pp. 1–17.

[11] Lampson, B. W. The ABCD’s of Paxos. In Proc. PODC’01, ACM Symposium on Principles of Distributed Computing (2001), ACM, pp.13–13.

Cites this article as

T. S. K. , V. I. , D. S. , "Analysis of Raft Consensus Algorithm ", International Journal of Innovative Research in Engineering & Management (IJIREM), Vol-7, Issue-4, Page No-38-40, 2020. Available from: