Unsupervised round robin catch up algorithm

A system, comprising:

• one or more processors;
• and
• memory that includes instructions that, if executed by the one or more processors, cause the system to:
• detect that a state of the system is stale based at least in part on information obtained from at least one node of a set of nodes of a data replication group;
• initialize a set of teachers corresponding to a set of other nodes of the data replication group, where the set of teachers includes information that enables the system to obtain state information from the set of teachers;
• and
• until determining that the state of the system is current, iteratively perform a non-redundant catch up algorithm to update the state of the system by at least:
• selecting a first teacher from the set of teachers corresponding to a particular node of the set of nodes;
• and
• obtaining state information from the first teacher to update the state of the system.

A computer-implemented method, comprising:

• initializing a data replication group with a plurality of nodes implementing a consensus protocol;
• detecting that a state of a node of the plurality of nodes has yet to advance to a state of at least one other node of the plurality of nodes of the data replication group;
• initializing, by the node, a set of teachers, wherein the set of teachers includes information that enable the node to obtain information from the set of teachers;
• and
• until determining that the state of the node has advanced to the state of the at least one other node of the plurality of nodes of the data replication group, iteratively performing, by the node, a non-redundant catch up algorithm to update the state of the node comprising:
• selecting a teacher from the set of teachers, the teacher corresponding to a particular node of the plurality of nodes;
• obtaining update information from the teacher;
• and
• updating the state of the node in accordance with the update information.