MESSAGE COMPLEXITY OF HIERARCHICAL QUORUM CONSENSUS ALGORITHM

Full metadata record

DC Field	Value	Language
dc.contributor.author	CHANG, HK	en_US
dc.contributor.author	YUAN, SM	en_US
dc.date.accessioned	2014-12-08T15:04:02Z	-
dc.date.available	2014-12-08T15:04:02Z	-
dc.date.issued	1994-04-22	en_US
dc.identifier.issn	0020-0190	en_US
dc.identifier.uri	http://dx.doi.org/10.1016/0020-0190(94)00012-3	en_US
dc.identifier.uri	http://hdl.handle.net/11536/2532	-
dc.description.abstract	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 N0.63. 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. It is shown that the ratio converges to a constant.	en_US
dc.language.iso	en_US	en_US
dc.subject	ANALYSIS OF ALGORITHMS	en_US
dc.subject	REPLICATED DATA	en_US
dc.subject	HIERARCHICAL QUORUM CONSENSUS	en_US
dc.subject	QUORUM SIZE	en_US
dc.subject	MESSAGE COMPLEXITY	en_US
dc.title	MESSAGE COMPLEXITY OF HIERARCHICAL QUORUM CONSENSUS ALGORITHM	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1016/0020-0190(94)00012-3	en_US
dc.identifier.journal	INFORMATION PROCESSING LETTERS	en_US
dc.citation.volume	50	en_US
dc.citation.issue	2	en_US
dc.citation.spage	69	en_US
dc.citation.epage	73	en_US
dc.contributor.department	資訊工程學系	zh_TW
dc.contributor.department	Department of Computer Science	en_US
dc.identifier.wosnumber	WOS:A1994NH75400003	-
dc.citation.woscount	1	-
Appears in Collections:	Articles

Files in This Item:

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.