Assume that 5 notes (A, B, C, D, and E) are implementing the…
Assume that 5 notes (A, B, C, D, and E) are implementing the RAFT algorithm, and have been operating normally with E as their leader and any node able to reach any other node. Now assume a network partition occurs, so that nodes A and B are separated from nodes C, D, and E. Nodes A and B can communicate with each other, but not with nodes C, D, or E, and vice versa. What will happen next?
Read DetailsYou are given two clocks: one is slower than the perfect clo…
You are given two clocks: one is slower than the perfect clock (UTC) by a drift rate of p, while the other one is faster than the perfect clock by a drift rate of q. How often should the clocks be synchronized to keep them within ∆t of one another?
Read Details