"Raft - The Understandable Distributed Protocol" by Ben Johnson (2013)

แชร์
ฝัง
  • เผยแพร่เมื่อ 28 พ.ย. 2024

ความคิดเห็น • 8

  • @humblephi473
    @humblephi473 2 ปีที่แล้ว +9

    Having the Questions is really good for a better understanding of the concept.

  • @DeGoya
    @DeGoya 2 ปีที่แล้ว +20

    26:59 was that Martin Kleppmann speaking?

    • @arno.claude
      @arno.claude ปีที่แล้ว +1

      Judging from his voice, yes.

  • @PFG666
    @PFG666 6 หลายเดือนก่อน

    Excellent presentation, the explanation of Raft was clear and not hard to follow. Also good questions!

  • @reviewsbyraf
    @reviewsbyraf 2 ปีที่แล้ว +1

    How gossip can work in integration with it

  • @ThePradeep2010
    @ThePradeep2010 3 ปีที่แล้ว +1

    What will happen if network partition happen after leader get consensus from follower and commit in its store but when it tries to send confirmation to follower to commit?

    • @WillCodeForViews
      @WillCodeForViews 3 ปีที่แล้ว +1

      i have the same question! if you find out, please let me know

    • @ssujeen3034
      @ssujeen3034 3 ปีที่แล้ว +5

      For simplicity let's just assume the leader is unable to communicate with any other node because of the network partition. Then the election timeout happens in any of the followers because the leader can't send heartbeat messages anymore. The constraints in election guarantee that if a new leader is elected, it must be one of the nodes which have the committed entries of the old leader from the last term. Those entries are not yet committed in the new leader yet because the rpc message sent by the old leader with the updated commit index was lost because of the network partition. There is another constraint in raft by which a leader can't commit entries from the older terms until it commits an entry in the current term. Once it commits an entry in the current term, it implies previous entries can also be safely committed because of the log matching property. Hope this helps.