Analysis of probabilistic trapezoid protocol for data replication

Maintaining the replicated data between nodes can improve the dependability of data. We propose a probabilistic trapezoid protocol for replicated data that combines this protocol with the concept of a probabilistic quorum system. We analyzed read availability, the latest version read availability and the average number of nodes accessed for the protocol. Our numerical evaluations demonstrated that it improves not only read availability but also latest version read availability. Furthermore, when the number of nodes is greater than 100, it could effectively reduce system load. We designed and implemented a file transfer protocol to replicate data. Experimental results proved that the trapezoid protocol could achieve better throughput than quorum system or grid protocol. Despite node failure, the probabilistic trapezoid protocol also achieved relatively better throughput.

[1]  Miron Livny,et al.  Conflict detection tradeoffs for replicated data , 1991, TODS.

[2]  Mostafa H. Ammar,et al.  The Grid Protocol: A High Performance Scheme for Maintaining Replicated Data , 1992, IEEE Trans. Knowl. Data Eng..

[3]  Hee Yong Youn,et al.  Analysis of read and write availability for generalized hybrid data replication protocol , 2004, 10th IEEE Pacific Rim International Symposium on Dependable Computing, 2004. Proceedings..

[4]  Divyakant Agrawal,et al.  The Tree Quorum Protocol: An Efficient Approach for Managing Replicated Data , 1990, VLDB.

[5]  Patrick Th. Eugster,et al.  Route driven gossip: probabilistic reliable multicast in ad hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[6]  Karen R. Sollins,et al.  The TFTP Protocol (Revision 2) , 1992, RFC.

[7]  Patrick Th. Eugster,et al.  PAN: providing reliable storage in mobile ad hoc networks with probabilistic quorum systems , 2003, MobiHoc '03.

[8]  Divyakant Agrawal,et al.  The generalized tree quorum protocol: an efficient approach for managing replicated data , 1992, TODS.

[9]  Moni Naor,et al.  The Load, Capacity, and Availability of Quorum Systems , 1998, SIAM J. Comput..

[10]  Michael K. Reiter,et al.  Probabilistic quorum systems , 1997, PODC '97.

[11]  Luiz André Barroso,et al.  Web Search for a Planet: The Google Cluster Architecture , 2003, IEEE Micro.

[12]  David K. Gifford,et al.  Weighted voting for replicated data , 1979, SOSP '79.

[13]  K. R. Sollins,et al.  The TFTP Protocol , 1981 .

[14]  Youn Hee Yong,et al.  An Efficient Hybrid Replication Protocol for High Available Distributed System , 2005 .