Distributed consensus revised – Part II
Distributed consensus revised (part II) Howard, PhD thesis
In today’s post we’re going to be looking at chapter 3 of Dr Howard’s thesis, which is a tour (“systematisation of knowledge”, SoK) of some of the major known revisions to the classic Paxos algorithm.
Negative responses (NACKs)
In classic Paxos acceptors only send replies to proposer messages with an epoch greater than or equal to the acceptors last promised epoch (Property 6). The algorithms relies on timeouts to determine when a proposer abandons the current phase and retries with a new epoch number. We can eliminate the timeout delays by adding negative responses, for example and
, to be sent by the acceptor in response to prepare or propose messages with an invalid epoch number. These negative acknowledgements (NACKS) can also include further information such as the acceptor’s last promised epoch and last accepted proposal value. (There’s no point a proposer retrying with a new epoch less than the acceptor’s last promised one for example).
NACKs have replaced timeouts as we assume that messages are eventually delivered. We can therefore remove the synchrony assumptions from our progress proof.
Bypassing phase two
If a proposer learns during phase one that a value Continue reading
MobiledgeX first announced its platform in February when it launched its first public edge network...
Network operators and infrastructure vendors are reimagining their role in a 5G-powered future and...
Magenta Telekom launches in Austria following T-Mobile’s merger with UPC Austria and readies for...
The Pentagon recently named Amazon and Microsoft as the finalists for the much-debated $10 billion...
SAP said it has now rolled out 10 new products that combine its operational data (O-data) with...
“We’re kicking ass in the market continuing to displace the legacy vendors,” says Exabeam CEO...