Browse > Article

Symmetric Tree Replication Protocol for Efficient Distributed Storage System  

최성춘 (성균관대학교 정보통신공학부 컴퓨터공학)
윤희용 (성균관대학교 정보통신공학부)
이강신 (한국정보보호진흥원 기반보호기술팀)
이호재 (LG전자 전자기술원)
Publication Information
Journal of KIISE:Computer Systems and Theory / v.31, no.9, 2004 , pp. 503-513 More about this Journal
Abstract
In large distributed systems, replications of data and service are needed to decrease communication cost, increase availability, and avoid single server bottleneck. Tree Quorum protocol is a representative replication protocol, which exploits a logical structure. Tree quorum protocol is one of the replication protocols allowing low read cost only in the best case, while the number of replicas exponentially increases as the level grows. In this paper, thus, we propose a new replication protocol, called symmetric tree protocol which efficiently solves the problem. The proposed symmetric tree protocol also requires much smaller read cost than 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. Also, the symmetric tree protocol has much smaller response time than the logarithmic protocol.
Keywords
Replication protocol; tree quorum; tree quorum; availability; distributed system; symmetric tree;
Citations & Related Records
연도 인용수 순위
  • Reference
1 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
2 S. Cheung, M. Ammar, and M. Ahamad, The Grid Protocol: A High Performance Scheme for Maintaining Replicated Data, Proc of the 6th Intl Conf on Data Engineering, 1990, 438-445
3 H. Lamehamedi, B. K. Szymanski, Z.Shentu, and E. Deelman, Data Replication Strategies in Grid Environments, Proc of ICAP'03, 2002, 378-383   DOI
4 B. Freisleben, H.H. Koch, and O. Theel, Designing Multi-Level Quorum Schemes for Highly Replicated Data. Proc. of the 1991 Pacific Rim Intl Symp on Fault Tolerant Systems, IEEE, 1991, 154-159   DOI
5 D.K. Gifford, Weighted Voting for Replicated Data, Proc. of the 7th ACM Symp on Operating Systems Principles, 1979, 150-162   DOI
6 Lamehamedi, H., Zujun Shentu, Szymanski, R, and Deelman, E., Simulation of dynamic data replication strategies in Data Grids, Proc of the Intl Symp on Parallel and Distributed Processing, 2003, 22-26   DOI   ScienceOn
7 R.H. Thomas. A Majority Consensus Approach to Concurrency Control for Multiple Copy Databased, ACM Trans on Database Systems, 4(2),1979, 180-207   DOI   ScienceOn
8 D. Davcev, A Dynamic Voting Scheme in Distributed Systems. IEEE Trans on Software Engineering, 15(1), 1989, 93-97   DOI   ScienceOn
9 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   DOI   ScienceOn
10 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   DOI   ScienceOn
11 C. Amza., A.L. Cox, W. Zwaenepoel, Data replication strategies for fault tolerance and availability on commodity clusters, Proc. Intl Conf on Dependable Systems and Networks (DSN), 2000, 459-467   DOI
12 G. Alonso, Partial Database Replication and Group Communication Primitives, Proc. of the 2nd European Research Seminar on Advances in Distributed Systems (ERSADS97), March 1997, 171-176
13 K. Arai, K. Tanaka, M. Takizawa, Group protocol for quorum-based replication, Proc. Seventh Intl Conf on Parallel and Distributed Systems, 2000, 57-64   DOI
14 H. Y. Youn, B. Krishnarnsetty, 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. Intl Conf on Communication and Computer Networks (DSN), Nov, 2002