MESSAGE COMPLEXITY OF HIERARCHICAL QUORUM CONSENSUS ALGORITHM

標題:	MESSAGE COMPLEXITY OF HIERARCHICAL QUORUM CONSENSUS ALGORITHM
作者:	CHANG, HK YUAN, SM 資訊工程學系 Department of Computer Science
關鍵字:	ANALYSIS OF ALGORITHMS;REPLICATED DATA;HIERARCHICAL QUORUM CONSENSUS;QUORUM SIZE;MESSAGE COMPLEXITY
公開日期:	22-四月-1994
摘要:	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.
URI:	http://dx.doi.org/10.1016/0020-0190(94)00012-3 http://hdl.handle.net/11536/2532
ISSN:	0020-0190
DOI:	10.1016/0020-0190(94)00012-3
期刊:	INFORMATION PROCESSING LETTERS
Volume:	50
Issue:	2
起始頁:	69
結束頁:	73
顯示於類別：	期刊論文

文件中的檔案：

若為 zip 檔案，請下載檔案解壓縮後，用瀏覽器開啟資料夾中的 index.html 瀏覽全文。