I was wondering what is the relationship between view-change algorithm and Paxos? In my lecture notes it states that "participants in each view agree on the primary, that later on governs the replication process". What is the view in this context and how Paxos relates to this?
view change algorithm and paxos
836 Views Asked by Bober02 At
1
There are 1 best solutions below
Related Questions in DISTRIBUTED-SYSTEM
- Is curator's persistent ephemeral nodes just regular ephemeral with retries?
- Sequential Consistency in Distributed Systems
- Elastic Search: how to move a primary shard?
- Hbase: Understanding difference between smallCompactions and largeCompactions under majorCompaction
- Mnesia - Replicate ram_copy table to disc_only_copy table from another node
- Logical Clocks: Lamport Timestamps
- Lamport’s (Physical) Clock Synchronization Algorithm
- distributed database replication design: efficient network transfer
- Use SimPy to simulate Chord distributed system
- How CreateEntity PDU works?
- How to automatically update server and client side in java
- Distributed database use cases
- Pass map, slice over channel and over network?
- Creating a distributed memory service in Scala
- What is the biggest Couchbase cluster nodes number?
Related Questions in PAXOS
- several questions about multi-paxos?
- How a distributed storage system like Raft filter duplicate requests even after client session expiration
- Paxos vs two phase commit
- What's the benefit of advanced master election algorithms over bully algorithm?
- Paxos algorithm: Dependency of Accept and Prepare phases
- Doesn't Paxos end up with the same instructions in the exact same order?
- view change algorithm and paxos
- Clarifications regarding Paxos and the paper Paxos Made Simple
- How can I understand "value" in bacis paxos
- paxos algorithm - how does the propose stage work?
- paxos: why do ids have to increase monotonically?
- Can multiple values be accepted in a single run?
- distributed system (RPC + Paxos)
- How paxos work with 2 nodes?
- In "Part-time Parliament" why does using the membership from decree n-3 work to add or remove members?
Related Questions in DISTRIBUTED-ALGORITHM
- view change algorithm and paxos
- distributed algorithm in C
- implement Broadcast Tree on OMNET++
- Julia Distributed, failed to modify the global variable of the worker
- What if vector clock update reaches much before the actual update?
- is there tool to build distributed search techniques?
- Environment to simulate classic distributed computation model on single machine
- open source gossip-based membership protocol?
- Space complexity of distributed algorithm
- Two phase commit: what happens if the coordinator dies between sending two confirmations
- Safe value transfer between databases
- How to implement distributed algorithm of leader election using JBotsim library
- What is wrong with this algorithm execution in Java?
- What is the difference between consistent hashing and cone hashing?
- Starting 2 hazelcast instances synchronously on a single machine (with hazelcast.initial.min.cluster.size=2)
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
The concept of "view" in paxos is applicable in scenarios where the number of nodes (proposers/acceptors/learners) is dynamic.
Imagine a scenario where nodes discover each other via UDP broadcast on startup. At any point in time, you can have a variable number of nodes running. Each time this "number of nodes" changes, that would indicate a new view.
Why this is important is because in such a dynamic environment, how do you ascertain what the "quorom" size is for accepting messages? By prepending a monotonically increasing ViewNumber to the ProposalNumber (also called a Viewstamp), this allows for graceful detection of changes in the "view" or number of nodes.
The whole view/replication concept is coined in the article:
Paxos Made Practical