This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Coding-Based Replication Schemes for Distributed Systems
March 1995 (vol. 6 no. 3)
pp. 240-251

Abstract—Data is often replicated in distributed systems to improve availability and performance. This replication is expensive in terms of disk storage since the existing schemes generally require full files to be stored at each site. In this paper, we present schemes which significantly reduce the storage requirements in replication based systems. These schemes use the coding method suggested by Rabin to store replicated data. The first scheme that we present is a modification of the simple voting algorithm and its quorum requirements. We then show how some of the extensions of the voting algorithm can also be modified to get storage efficient schemes for managing such replication. We evaluate the availability offered by these schemes and show that the storage space required to achieve certain availability are significantly lower than the conventional schemes with full file replication. Since coding is used, these schemes also provide a high degree of data security.

Index Terms—Availability, coding schemes, data replication, data security, disk usage, distributed databases, fault-tolerance, performance evaluation, voting protocols.

[1] D. Agrawal and A. El Abbadi,“Reducing storage for quorum consensus algorithms,”inProc. Very Large Databases Conf.,1988, pp. 419–430.
[2] ——,“Storage efficient replicated databases,”IEEE Trans. Data, Knowl. Eng., vol. 2, pp. 342–351, Sept. 1990.
[3] ——,“Integrating security with fault tolerance in distributed databases,”inComput. J., vol. 33, no. 2, pp. 71–78, Feb. 1990.
[4] G. Agrawal and P. Jalote,“An efficient protocol for voting in dist. systems,”inProc. 12th Int. Conf. Dist. Comput. Syst., June 1992.
[5] M. Ahamad and M. H. Amnar,“Performance characterization of quorum consensus algorithms for replicated data,”IEEE Trans. Software Eng., vol. 15, pp. 492–496, Apr. 1989.
[6] G. Ciardo and J. K. Muppala,Manual for SPNP Package version 3.0,Duke University, Durham, NC, July 1990.
[7] D. Barbara and H. Garcia-Molina, "The Vulnerability of Vote Assignments," ACM Trans. Computer Systems, vol. 4, pp. 187-213, Aug. 1986.
[8] D. Barbara and H. Garcia-Molina, "The Reliability of Voting Mechanisms," IEEE Trans. Computers, vol. 36, pp. 1,197-1,208, Oct. 1987.
[9] P.A. Bernstein and N. Goodman, "An Algorithm for Concurrency Control and Recovery in Replicated Distributed Databases," ACM Trans. Database Systems, vol. 9, no. 4, pp. 596-615, Dec. 1984.
[10] W. A. Burkhard and P. D. Stojadinovic“Storage efficient reliable files,”inProc. 1992 Winter USENIX Conf., 1992, pp. 69–77.
[11] D. Davcev and W. Burkhard, “Consistency and Recovery Control for Replicated Files,” Proc. 10th ACM Symp. Operating Systems Principles, pp. 87-96, 1985.
[12] S.B. Davidson, H. Garcia-Molina, and D. Skeen, "Consistency in Partitioned Networks," ACM Computing Surveys, vol. 17, no. 3, pp. 341-370, Sept. 1985.
[13] H. Garcia-Molina and D. Barbara, “How to Assign Votes in a Distributed System,” J. ACM, vol. 32, no. 4, pp. 841-860, Oct. 1985.
[14] D.K. Gifford, “Weighted Voting for Replicated Data,” Proc. Seventh ACM SIGOPS Symp. Operating Systems Principles, pp. 150-159, Dec. 1979.
[15] S. Jajodia and D. Mutchler, "Dynamic Voting," Proc. 1987 ACM Int'l Conf. Management of Data (SIGMOD), pp. 227-238, 1987.
[16] S. Jajodia and D. Mutchler,“Enhancements to the voting algorithm,”inProc. 13th Int. Conf. Very Large Databases, 1987, pp. 399–406.
[17] S. Jajodia and D. Mutchler, “Dynamic Voting Algorithms for Maintaining the Consistency of a Database,” ACM Trans. Data Systems, vol. 15, no. 2, pp. 230-280, June 1990.
[18] L. Mirsky,An Introduction to Linear Algebra. New York: Dover, 1982.
[19] J. F. Paris,“Voting with witnesses: a consistency scheme for replicated files,”inProc. 6th IEEE Int. Conf. on Distrib. Comput. Syst., 1986, pp. 606–612.
[20] ——,“Voting with a variable number of copies,”inProc. 16th IEEE Fault-Tolerant Comput. Symp., 1986, pp. 50–55.
[21] ——,“Voting with bystanders,”inProc. 9th Int. Conf. Distrib. Comput. Syst., 1989, pp. 394–401.
[22] C. Pu, J. D. Noe, and A. Proudfoot,“Regeneration of replicated objects: A technique and its eden implementation,”inProc. 3rd IEEE Int. Conf. Data Eng., 1987, pp. 175–187.
[23] M. O. Rabin,“Efficient dispersal of information for security, load balancing and fault-tolerance,”Harvard University, Cambridge, MA, TR-02-87, Apr. 1987.
[24] M.O. Rabin, Efficient Dispersal of Information for Security, Load Balancing and Fault Tolerance J. ACM, vol. 36, no. 2, pp. 335-348, 1989.
[25] R. van Renesse and A. S. Tannenbaum,“Voting with ghosts,”inProc. 8th IEEE Int. Conf. Distrib. Comput. Syst., 1988, pp. 456–461.
[26] R. D. Schlichting and F. B. Schneider,“Fail-stop processors: An approach to designing fault-tolerant computing systems,”ACM Trans. Comput. Syst., vol. 1, no. 3, pp. 222–238, Aug. 1983.

Citation:
Gagan Agrawal, Pankaj Jalote, "Coding-Based Replication Schemes for Distributed Systems," IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 3, pp. 240-251, March 1995, doi:10.1109/71.372774
Usage of this product signifies your acceptance of the Terms of Use.