From fd09a9ada67834be388581e442f6c48585ca90e3 Mon Sep 17 00:00:00 2001 From: Susana C Delgadillo Date: Sat, 11 Jun 2016 18:16:33 -0400 Subject: [PATCH] Update 'Paxos Made Live' link --- input/4_replication.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/input/4_replication.md b/input/4_replication.md index 2021a2a..df37a46 100644 --- a/input/4_replication.md +++ b/input/4_replication.md @@ -283,7 +283,7 @@ Of course, implementing this algorithm is much harder than it sounds. There are - procedures for bringing a new replica up to date in a safe and efficient manner after a crash, disk loss or when a new node is provisioned - procedures for snapshotting and garbage collecting the data required to guarantee safety after some reasonable period (e.g. balancing storage requirements and fault tolerance requirements) -Google's [Paxos Made Live](http://labs.google.com/papers/paxos_made_live.html) paper details some of these challenges. +Google's [Paxos Made Live](http://research.google.com/archive/paxos_made_live.html) paper details some of these challenges. ## Partition-tolerant consensus algorithms: Paxos, Raft, ZAB