Questions tagged [paxos]

Paxos is a family of protocols for a network of unreliable processors to agree on a result.

132 questions
3
votes
1 answer

How to derive a sequence number in paxos

In paxos, every proposer independently generates a sequence number for its proposal. So let's say a proposer keeps on generating higher numbered sequence number. Won't this proposer because he is generating higher sequence number nullify other…
ffff
  • 2,853
  • 1
  • 25
  • 44
3
votes
2 answers

Is keep logging messages in group communication service or paxos practical?

In the case of network partition or node crash, most of the distributed atomic broadcast protocols (like Extended Virtual Synchrony or Paxos), require running nodes, to keep logging messages, until the crashed or partitioned node rejoins the…
3
votes
0 answers

How to safely reset corrupted Zookeeper server

Zookeeper admin guide say the following: A server might not be able to read its database and fail to come up because of some file corruption in the transaction logs of the ZooKeeper server. You will see some IOException on loading ZooKeeper …
skyde
  • 2,816
  • 4
  • 34
  • 53
3
votes
1 answer

using sql primary keys for master election- is there a flaw in this approach?

Let's say I've SQL schema like this- create table master_lock(job_type int primary key, ip varchar); Now each node tries to insert a value like this- insert into master_lock values(1,192.168.1.1); insert into master_lock …
3
votes
2 answers

Paxos and Discovery

Suppose I throw some machines in an elastic cluster and want to run some consensus algorithm in they (say, Paxos). Suppose they know the initial size of the network, say, 8 machines. So, they'll run a consensus algorithm, and the quorum is 5. Now,…
Luís Guilherme
  • 2,620
  • 6
  • 26
  • 41
3
votes
2 answers

Cassandra's lightweight transactions & Paxos consensus algorithm

I have a very particular question regarding Paxos algorithm, which is implemented in Cassandra's lightweight transactions: What happens if two nodes issue the same proposal at the same time? Do them both get '[applied]: true' ? For example, consider…
AlonL
  • 6,100
  • 3
  • 33
  • 32
2
votes
2 answers

In Paxos, why can't we use random backoff to avoid collision?

I understand that the heart of Paxos consensus algorithm is that there is only one "majority" in any given set of nodes, therefore if a proposer gets accepted by a majority, there cannot be another majority that accepts a different value, given that…
Weipeng
  • 1,494
  • 14
  • 11
2
votes
1 answer

Does paxos provide true linearizable consistency or not?

I think I might be confusing concepts here, but it seems to me like paxos would provide linearizable consistency for systems that implement it. I know Cassandra uses it. I'm not 100% clear on how but assuming a leader is elected and that single…
red888
  • 27,709
  • 55
  • 204
  • 392
2
votes
1 answer

paxos for system builder

Why a separate phase of Leader Election is required in the paper Paxos for System Builders: An Overview instead of using the prepare phase for the leader election? What advantages does this additional phase provide over using the implicit prepare…
2
votes
2 answers

Why Paxos is required for leader election in cassandra

I was reading about the Protocol for distributed consensus and came across the Paxos. It states that you require Paxos for the leader election. Article claiming the same. So, my question is when Cassandra is a ring architecture not master-slave why…
Naresh
  • 5,073
  • 12
  • 67
  • 124
2
votes
1 answer

what's the difference between single paxos state machine and multi paxos state machine in spanner paper

From the spanner paper, it says that "To support replication, each spanserver implements a single Paxos state machine on top of each tablet. (An early Spanner incarnation supported multiple Paxos state machines per tablet, which allowed for more…
baotiao
  • 775
  • 6
  • 20
2
votes
1 answer

Explanation of "Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols"

Can anyone, please, clarify step 3 (see below) in the "Completely Asynchronous Agreement Protocol": Process P: Initial value xp. Step 0: set r := 1. Step 1: Send the message (1, r, xp) to all the processes. Step 2: Wait till N - t messages of type…
DimanNe
  • 1,791
  • 3
  • 12
  • 19
2
votes
2 answers

Why is it legit to take the next two commands to fill gaps between paxos events?

There is a point in Paxos algorithm (http://research.microsoft.com/en-us/um/people/lamport/pubs/paxos-simple.pdf) that I do not understand. It's about how to deal with the gaps, the paper describe two ways as below: The leader, as well as any other…
2
votes
3 answers

Confusing about P2b proving process in paper Paxos made simple

I'm reading the paper Paxos made simple but got stuck on the proving part for P2b. Content of rule P2b: If a proposal with value v is chosen, then every higher-numbered proposal issued by any proposer has value v. And this is the proving part by…
shizhz
  • 11,715
  • 3
  • 39
  • 49
2
votes
0 answers

Why doesn't CORFU the Distributed Shared Log validate deletes?

The paper CORFU: A Distributed Shared Log presents the protocol in psudeo code which doesn't validate delete messages. To quote the paper: Upon request: mark addr deleted respond ack This means that we can delete pages that have…
simbo1905
  • 6,321
  • 5
  • 58
  • 86
1 2 3
8 9