The STUDIA UNIVERSITATIS BABEŞ-BOLYAI issue article summary

The summary of the selected article appears at the bottom of the page. In order to get back to the contents of the issue this article belongs to you have to access the link from the title. In order to see all the articles of the archive which have as author/co-author one of the authors mentioned below, you have to access the link from the author's name.

 
       
         
    STUDIA INFORMATICA - Issue no. 2 / 2020  
         
  Article:   LOG REPLICATION IN RAFT VS KAFKA.

Authors:  MANUELA PETRESCU, RĂZVAN PETRESCU.
 
       
         
  Abstract:  
DOI: 10.24193/subbi.2020.2.05

Published Online: 2020-12-12
Published Print: 2020-12-30
pp. 66-77

FULL PDF

VIEW PDF


Abstract. The implementation of a fault-tolerant system requires some type of consensus algorithm for correct operation. From Paxos to View-stamped Replication and Raft multiple algorithms have been developed to handle this problem. This paper presents and compares the Raft algorithm and Apache Kafka, a distributed messaging system which, although at a higher level, implements many concepts present in Raft (strong leadership, append-only log, log compaction, etc.). This shows that mechanisms conceived to handle one class of problems (consensus algorithms) are very useful to handle a larger category in the context of distributed systems.

Received by the editors: 25 September 2020.
2010 Mathematics Subject Classiffication. 68U99.
1998 CR Categories and Descriptors. C.2.4 [Computer Communication Systems]: Distributed Systems - Distributed applications.
Key words and phrases. comparison, Raft, Kafka, consensus algorithm, replicated log.
 
         
     
         
         
      Back to previous page