Paxos derived
muratbuffalo.blogspot.com
muratbuffalo.blogspot.com
https://ug93tad.github.io/consensus/
And on the topic of Paxos, some recent HN discussion:
https://news.ycombinator.com/item?id=16003662 - WPaxos: a wide area network Paxos protocol
https://news.ycombinator.com/item?id=13923949 - Paxos in 25 Lines
https://news.ycombinator.com/item?id=13950493 - Gryadka is not Paxos, so it's probably wrong [RETRACTED]
This is unclear to me. Egalitarian Paxos guarantees progress under a full asynchronous model and doesn't have the dueling leaders problem. So this looks like a weakness of standard Paxos itself, not a fundamental problem.
Zorn introduced a "maximal principle" as an axiom. It appears Tukey called a generalization of it Zorn's Lemma for unknown reasons, though there is some version of the statement that really is proved, but apparently by Chevalley (a fact Zorn knew).
Paxos is one of the algorithms that solves this problem by giving you a protocol that allows the sets of machines to agree upon a set of operations that would all be applied to their states thus giving you a set of machines in the same state.
A simple example, is if you had a set of 3 machines starting with state of “0” and wanted to add “1” to their state. Paxos would define how they should communicate so that in the end, even if one of the machines failed during execution, would all end up with a state of “1”.
(The TLD is “com”, which you probably see fairly often in that role.)
...yes.
I do think you make a good point that we don't always need Paxos-like protocols. Paxos is a very strong tool, so it solves a difficult problem, but is heavy-handed in many scenarios. There is a lot of space to explore lighter-weight alternatives to Paxos while still providing similarly strong properties.