442 Hits in 5.2 sec

Message complexity of hierarchical quorum consensus algorithm

Her-Kun Chang, Shyan-Ming Yuan
1994 Information Processing Letters  
The hierarchical quorum consensus (HQC) algorithm, which is a generalization of the standard quorum consensus algorithm for managing replicated data, can reduce the quorum size to NO.'j".  ...  This paper analyzes the message complexity of HQC. Moreover, an asymptotic analysis on the ratio of the message complexity to the quorum size is presented.  ...  Conclusions This paper analyzes the message complexity of the hierarchical quorum consensus algorithm.  ... 
doi:10.1016/0020-0190(94)00012-3 fatcat:x2aymga4q5h2tldchnnbrhkvnu

Dynamic Quorums for DHT-based P2P Networks

R. Baldoni, L. QuerzonI, A. Virgillito, R. Jimenez-Peris, M. Patino-Martynez
2005 Fourth IEEE International Symposium on Network Computing and Applications  
The main reason is that more complex applications require levels of consistency that nowadays are not offered by P2P systems.  ...  These design principles consist in dynamic and decentralized selection of quorums and in the exposition and exploitation of internals of the DHT such as the finger table.  ...  In the following we refer to such algorithm as Decentralized Hierarchical Quorum Consensus (D-HQC).  ... 
doi:10.1109/nca.2005.17 dblp:conf/nca/BaldoniQVJP05 fatcat:74tp4heue5bexcomp3qwcrmz4i

Harnessing the power of DHTs to build dynamic quorums in large-scale enterprise infrastructures

Roberto Baldoni, Ricardo Jiménez-Peris, Marta Patiño-Martínez, Leonardo Querzoni, Antonino Virigllito
2008 Proceedings of the 2nd Workshop on Large-Scale Distributed Systems and Middleware - LADIS '08  
These design principles consist of a dynamic and decentralized selection of quorums and in the exposure and exploitation of internals of the DHT.  ...  In the context of classical distributed applications, quorum systems have been considered as a major building block for implementing many paradigms, from distributed mutual exclusion to data replication  ...  The first one, named farsighted, is a novel quorum system that extends hierarchical quorum consensus [7] by offering higher flexibility in choosing quorums with the additional advantage of enabling smaller  ... 
doi:10.1145/1529974.1529981 fatcat:sy4cla7gmrgkpimolzufoqi2vm

Dynamic quorums for DHT-based enterprise infrastructures

Roberto Baldoni, Ricardo Jiménez-Peris, Marta Patiño-Martínez, Leonardo Querzoni, Antonino Virgillito
2008 Journal of Parallel and Distributed Computing  
a quorum, and the latency of quorum acquisition  ...  These design principles consist in a dynamic and decentralized selection of quorums and in the exposition and exploitation of internals of the DHT.  ...  Schuster, for the insightful discussions during the review process that improved considerably the content of the paper.  ... 
doi:10.1016/j.jpdc.2008.04.006 fatcat:w54wcmhh7ffd5eqf52f6bruhc4

Self Organized Replica Overlay Scheme for P2P Networks

Shashi Bhushan, Mayank Dave, R. B. Patel
2012 International Journal of Computer Network and Information Security  
In this paper a self organized replica overlay scheme "Improved Hierarchical Quorum Consensus" (IHQC) for P2P systems is proposed.  ...  The results of simulation study of the proposed scheme also support and verify its better performance than Random and Hierarchical Quorum Scheme.  ...  It is further observed that the network overhead in case of hierarchical quorum consensus is small as compared to the random quorum. VI.  ... 
doi:10.5815/ijcnis.2012.10.02 fatcat:ghjqvqiddrcezdy4wsr27ybpdm

A survey of permission-based distributed mutual exclusion algorithms

P.C. Saxena, J. Rai
2003 Computer Standards & Interfaces  
In this paper, we present a survey of various permission-based distributed mutual exclusion (PBDME) algorithms and their comparative performance. D  ...  Depending on the technique used, these algorithms have been classified as token-based and permission-based algorithms.  ...  The hierarchical quorum consensus algorithm (HQC algorithm) turned out to be more general than ordinary voting, as there are quorums, based on this algorithm, which do not have an equivalent single-level  ... 
doi:10.1016/s0920-5489(02)00105-8 fatcat:na3u3ho6tzayle5qd7vlnchpmu

Towards an Automatic Proof of Lamport's Paxos [article]

Aman Goel, Karem A. Sakallah
2021 arXiv   pre-print
Lamport's celebrated Paxos consensus protocol is generally viewed as a complex hard-to-understand algorithm.  ...  Notwithstanding its complexity, in this paper, we take a step towards automatically proving the safety of Paxos by taking advantage of three structural features in its specification: spatial regularity  ...  Developed by Lamport, the Paxos consensus protocol allows a set of processes to communicate with each other by exchanging messages and reach agreement on a single value.  ... 
arXiv:2108.08796v1 fatcat:cehbhgk53re2plwxdval7lbpgi

What's Live? Understanding Distributed Consensus [article]

Saksham Chand, Yanhong A Liu
2021 arXiv   pre-print
Distributed consensus algorithms such as Paxos have been studied extensively. They all use the same definition of safety.  ...  This paper systematically studies and compares different liveness properties stated for over 30 prominent consensus algorithms and variants.  ...  For consensus algorithms, the following variables and predicates are used: • quorums -the set of quorums of servers used by the algorithm. • values -the set of valid values from which a value can be agreed  ... 
arXiv:2001.04787v2 fatcat:53x2qil5bneibayl63wdyeqdry

A delay-optimal quorum-based mutual exclusion algorithm for distributed systems

Guohong Cao, M. Singhal
2001 IEEE Transactions on Parallel and Distributed Systems  
In this paper, we propose a delay-optimal quorum-based mutual exclusion algorithm which reduces the synchronization delay to and still has a low message complexity of yu (u is the size of the quorum which  ...  The Lamport algorithm and the Ricart-Agrawal algorithm both have a synchronization delay of ( is the average message delay), but their message complexity is yx.  ...  ACKNOWLEDGMENTS The authors would like to thank the anonymous referees whose insightful comments helped us to improve the presentation of the paper.  ... 
doi:10.1109/71.970560 fatcat:6fzp6c32mbgvjoxo3asu5p6l4m

Multicoordinated agreement for groups of agents

Lasaro Camargos, Rodrigo Schmidt, Edmundo Madeira, Fernando Pedone
2010 Journal of the Brazilian Computer Society  
Protocols that use one coordinator are more resilient to acceptor failures, at the expense of one extra communication step even in the absence of failures.  ...  In this paper we exemplify its use in solving consensus and then introduce a fast multicoordinated agreement protocol for agents organized in groups, an abstraction for fast local area networks interconnected  ...  The same problem, agreement in groups of agents, was studied by Kooh and Haddad [21] . Their hierarchical consensus algorithm recursively agrees on proposals over a multilevel tree of agents.  ... 
doi:10.1007/s13173-010-0001-7 fatcat:iswvigko35hrzl2kd6pzksbkbq

Consensus Beyond Thresholds: Generalized Byzantine Quorums Made Live [article]

Orestis Alpos, Christian Cachin
2020 arXiv   pre-print
This paper presents the first implementation of BFT consensus with generalized quorums.  ...  An implementation of HotStuff BFT consensus using these quorum systems is described as well and compared to the existing threshold model.  ...  Acknowledgments This work has been funded by the Swiss National Science Foundation (SNSF) under grant agreement Nr. 200021 188443 (Advanced Consensus Protocols).  ... 
arXiv:2006.04616v2 fatcat:dpxrgiearbanremzszalrp32k4

Cooperative Decision-Making in Decentralized Multiple-Robot Systems: The Best-of-N Problem

C.A.C. Parker, Hong Zhang
2009 IEEE/ASME transactions on mechatronics  
The contribution of this work is a biologically inspired algorithm that enables a decentralized MRS composed of very simple robots to make good, unanimous decisions.  ...  In a series of physical experiments using real robots, the best decision was made at least 80% of the time. 100% of the decisions achieved perfect consensus, which prevented the MRS from becoming fragmented  ...  their estimates of apparent consensus when testing quorum) in Figure 8 .  ... 
doi:10.1109/tmech.2009.2014370 fatcat:2hnjombfefeafjg4ricy623eyq

Page 1190 of Mathematical Reviews Vol. , Issue 97B [page]

1997 Mathematical Reviews  
{For the entire collection see MR 97a:68006. } 97b:68061 68Q10 68P15 Kumar, Akhil (1-COD-B; Denver, CO); Malik, Kavindra (1-CRNL-GM; Ithaca, NY) Optimizing the costs of hierarchical quorum consensus.  ...  Quorum consensus requires that read and write operations 68 COMPUTER SCIENCE 1190 must assemble appropriate quorums before an operation can suc- ceed.  ... 

Automated Test Case Generation for the Paxos Single-decree Protocol using a Coloured Petri Net Model

Rui Wang, Lars Michael Kristensen, Hein Meling, Volker Stolz
2019 Journal of Logical and Algebraic Methods in Programming  
Implementing test suites for distributed software systems is a complex and timeconsuming task due to the number of test cases that need to be considered in order to obtain high coverage.  ...  The implementation, written in Go, takes advantage of quorum abstractions provided by the Gorums middleware library [20] .  ...  This quorum call sends the Accept message to the Acceptors, requesting them to vote for consensus value v.  ... 
doi:10.1016/j.jlamp.2019.02.004 fatcat:f5hkzed6vrfxroce3sp7mpdbpi

AWARE: Adaptive Wide-Area Replication for Fast and Resilient Byzantine Consensus

Christian Berger, Hans P. Reiser, Joao Sousa, Alysson Neves Bessani
2020 IEEE Transactions on Dependable and Secure Computing  
This enables more choice in quorum formation and replicas can leverage proportionally smaller quorums to advance, thus decreasing consensus latency.  ...  Essentially, AWARE is an automated and dynamic voting weight tuning and leader positioning scheme, which supports the emergence of fast quorums in the system.  ...  In total, the time complexity of SA is in O(n 2 log(n)).  ... 
doi:10.1109/tdsc.2020.3030605 fatcat:jhatbhuvqrek3hdxj2u366nai4
« Previous Showing results 1 — 15 out of 442 results