Analysis of Probabilistic Trapezoid Protocol for Data Replication
スポンサーリンク
概要
- 論文の詳細を見る
Maintaining replicated data between nodes can improve the dependability of data. We propose a probabilistic trapezoid protocol for replicated data that combines the trapezoid protocol with the concept of a probabilistic quorum system. We analyzed the read availability, the latest version's read availability and the average number of nodes accessed for the protocol. Our numerical evaluations demonstrated that it improves not only the read availability but also the latest version's read availability. Furthermore, when the number of nodes is greater than 100, it could effectively reduce the system's load. We designed and implemented a file transfer protocol to replicate data. Experimental results proved that the trapezoid protocol could achieve a better throughput than the voting system or the grid protocol. Despite node failure, the probabilistic trapezoid protocol also achieved a relatively better throughput.
- 一般社団法人 情報処理学会の論文
一般社団法人 情報処理学会 | 論文
- Interest Point Detection Based on Stochastically Derived Stability
- Efficient Algorithms for Extracting Pareto-optimal Hardware Configurations in DEPS Framework
- Verification of Substitution Theorem Using HOL (プログラミング Vol.5 No.2)
- Programmable Architectures and Design Methods for Two-Variable Numeric Function Generators
- An Exact Estimation Algorithm of Error Propagation Probability for Sequential Circuits