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...

Full description

Saved in:
Bibliographic Details
Published inInformation and Media Technologies Vol. 3; no. 3; pp. 498 - 511
Main Authors Suzuki, Tabito, Ohara, Mamoru, Arai, Masayuki, Fukumoto, Satoshi, Iwasaki, Kazuhiko
Format Journal Article
LanguageEnglish
Published Tokyo Information and Media Technologies Editorial Board 01.01.2008
Japan Science and Technology Agency
Subjects
Availability
Data replication
Failure
Media
Probabilistic methods
Probability theory
Trapezoids
Voting systems
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1881-0896
1881-0896
DOI:10.11185/imt.3.498