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.
This work was supported by Korea Research Foundation Grant (KRF-2002-041-D00421).
Chapter PDF
Similar content being viewed by others
Reference
C. Amza, A.L. Cox, W. Zwaenepoel, Data replication strategies for fault tolerance and availability on commodity clusters, Proc. Int’l Conf on Dependable Systems and Networks (DSN), 2000, 459–467
H.Y. Youn, B. Krishnamsetty, D. Lee, B. K. Lee, J.S. Choi, H.G. Kim, C.W. Park, and H.S. Lee, An Efficient Hybrid Replication Protocol for Highly Available Distributed System, Proc. Int’l Conf on Communication and Computer Networks (CCN), Nov, 2002
K. Arai, K. Tanaka, M. Takizawa, Group protocol for quorum-based replication, Proc. Seventh Int’l Conf on Parallel and Distributed Systems, 2000, 57–64.
G. Alonso, Partial Database Replication and Group Communication Primitives, Proc. of the 2 nd European Research Seminar on Advances in Distributed Systems (ERSADS’97), March 1997, 171–176.
P.A. Bernstein and N. Goodman, An Algorithm for Concurrency Control and Recovery in Replicated Distributed Databases, ACM Trans on Distributed Systems, 9(4), 1984, 596–615.
R.H. Thomas. A Majority Consensus Approach to Concurrency Control for Multiple Copy Data-based, ACM Trans on Database Systems, 4(2), 1979, 180–207.
D. Davcev, A Dynamic Voting Scheme in Distributed Systems. IEEE Trans on Software Engineering, 15(1), 1989, 93–97.
D. Saha, S. Rangarajan, S.K. Tripathi, An Analysis of the Average Message Overhead in Replica Control Protocols, IEEE Trans on Parallel and Distributed Systems, 7(10), Oct. 1996, 1026–1034.
B. Freisleben, H.H. Koch, and O. Theel, Designing Multi-Level Quorum Schemes for Highly Replicated Data. Proc. of the 1991 Pacific Rim Int’l Symp on Fault Tolerant Systems, IEEE, 1991, 154–159.
D.K. Gifford, Weighted Voting for Replicated Data, Proc. of the 7th ACM Symp on Operating Systems Principles, 1979, 150–162.
D. Agrawal and A. El Abbadi, The tree Quorum protocol: An Efficient Approach for Managing Replicated Data, Proc of the 16th Very Large Databases (VLDB) Conf, 1990, 243–254.
S. Cheung, M. Ammar, and M. Ahamad, The Grid Protocol: A High Performance Scheme for Maintaining Replicated Data, Proc of the 6th Int’l Conf on Data Engineering, 1990, 438–445.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Choi, S.C., Youn, H.Y., Choi, J.S. (2003). Symmetric Tree Replication Protocol for Efficient Distributed Storage System. In: Sloot, P.M.A., Abramson, D., Bogdanov, A.V., Gorbachev, Y.E., Dongarra, J.J., Zomaya, A.Y. (eds) Computational Science — ICCS 2003. ICCS 2003. Lecture Notes in Computer Science, vol 2659. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44863-2_47
Download citation
DOI: https://doi.org/10.1007/3-540-44863-2_47
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40196-4
Online ISBN: 978-3-540-44863-1
eBook Packages: Springer Book Archive