Symmetric tree replication protocol for efficient distributed storage system

Authors:
Sung Chune Choi;Hee Yong Youn;Joong Sup Choi
Affiliations:
School of Information and Communications Engineering, Sungkyunkwan University, Suwon, Korea;School of Information and Communications Engineering, Sungkyunkwan University, Suwon, Korea;Information Security Technology Division, Korea Information Security Agency, Seoul, Korea
Venue:
ICCS'03 Proceedings of the 2003 international conference on Computational science: PartIII
Year:
2003

Citing 9
Cited 1

An algorithm for concurrency control and recovery in replicated distributed databases

ACM Transactions on Database Systems (TODS)
A Dynamic Voting Scheme in Distributed Systems

IEEE Transactions on Software Engineering
An Analysis of the Average Message Overhead in Replica Control Protocols

IEEE Transactions on Parallel and Distributed Systems
A Majority consensus approach to concurrency control for multiple copy databases

ACM Transactions on Database Systems (TODS)
The Grid Protocol: A High Performance Scheme for Maintaining Replicated Data

Proceedings of the Sixth International Conference on Data Engineering
The Tree Quorum Protocol: An Efficient Approach for Managing Replicated Data

VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Data Replication Strategies for Fault Tolerance and Availability on Commodity Clusters

DSN '00 Proceedings of the 2000 International Conference on Dependable Systems and Networks (formerly FTCS-30 and DCCA-8)
Weighted voting for replicated data

SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
Group Protocol for Quorum-Based Replication

ICPADS '00 Proceedings of the Seventh International Conference on Parallel and Distributed Systems

An approach to reduce the energy cost of the arbitrary tree replication protocol

Proceedings of the 1st International Conference on Energy-Efficient Computing and Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

In large distributed systems, replication of data and service is needed to decrease the communication cost, increase the overall availability, avoid single server bottleneck, and increase the reliability. Tree quorum protocol is one of the replication protocols allowing very low read cost in the best case but has some drawbacks such that the number of replicas grows rapidly as the level increases and root replica becomes a bottleneck. In this paper we propose a new replication protocol called symmetric tree protocol which efficiently solves the problems. The proposed symmetric tree protocol also requires much smaller read cost than the previous protocols. We conduct cost and availability analysis of the protocols, and the proposed protocol displays comparable read availability to the tree protocol using much smaller number of nodes. It is thus effective to be applied to survival storage system.