Abstract
This paper presents a new type of Consensus problem named the Consensus (n, m) with alternative plans, where n denotes the total number of processors in the network, m is the number of processors with an initial value, n ≥ 4 and 1 ≤ m ≤ n. Compared to the traditional Consensus problem, the Consensus (n, m) problem with alternative plans has two major features. First, each processor is no longer required to propose an initial value. It can flexibly choose to propose or not propose an initial value. This feature allows the Consensus problem to be flexibly applied in many new real-world applications of the distributed system. Second, the proposed protocol ensures that all correct processors always agree on a good plan from a correct processor and never on a bad plan. Compared to solutions of the traditional Consensus problem, which does not guarantee that all correct processors agree on a good plan, this feature ensures the rationality of the Consensus value. In other words, by solving the Consensus (n, m) problem with alternative plans, the fault tolerance and reliability of distributed systems can be improved.
Highlights
Adistributed system is a software system where its components distributed across networked computers communicate and coordinate their actions by exchanging messages [1]
We propose a protocol that makes all the correct processors have the same set of good plans and the same set of bad plans [24]
In order to solve the Consensus (n, m) problem with alternative plans in a network with Byzantine processors, the Plan_Consensus Protocol (PCP) protocol is utilized to ensure that all the correct processors have the same set of good plans (GP) and the same set of bad plans (BP)
Summary
Adistributed system is a software system where its components distributed across networked computers communicate and coordinate their actions by exchanging messages [1]. Any protocol designed to solve the BVC problem must satisfy three requirements as follows [23], [25]: BVC_Agreement: All the correct processors agree on a common value. C. ALTERNATIVE PLANS In traditional agreement related problems (i.e. BA and Consensus problems), all the correct processors shall eventually accept a commonly agreed value. The value of m does not affect the number of rounds of message exchange and the number of messages that are required by the proposed protocol This feature allows the Consensus problem to be flexibly applied in many new real-world applications of the distributed system. 3) Under the influence from Byzantine processors, the proposed algorithm can still solve the Consensus(n,m) with alternative plans problem without using the reliable broadcast protocol.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
