This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Location-Based Paradigm for Replication: Achieving Efficiency and Availability in Distributed Systems
January 1995 (vol. 21 no. 1)
pp. 1-18
Replication techniques for transaction-based distributed systems generally achieve increased availability but with a significant performance penalty. We present a new replication paradigm, the location-based paradigm, which addresses availability and other performance issues. It provides availability similar to quorum-based replication protocols but with transaction-execution delays similar to one-copy systems. The paradigm further exploits replication to improve performance in two instances. First, it takes advantage of local or nearby replicas to further improve the response time of transactions, achieving smaller execution delays than one-copy systems. Second, it takes advantage of replication to facilitate the independent crash recovery of replica sites—a goal which is unattainable in one-copy systems. In addition to the above the location-based paradigm avoids bottlenecks, facilitates load balancing, and minimizes the disruption of service when failures and recoveries occur. In this paper we present the paradigm, a formal proof of correctness, and a detailed simulation study comparing our paradigm to one-copy systems and to other approaches to replication control.

[1] D. Agrawal and A. El Abbadi,“The tree quorum protocol: An efficient approach for managing replicated data,”inProc. Int. Conf. Very Large Data Bases, Aug. 1990.
[2] P. Bernstein, V. Hadzilacos, and N. Goodman, Concurrency Control and Recovery in Database Systems. Addison-Wesley, 1987.
[3] P. Bernstein and N. Goodman, "The Failure and Recovery Problem for Replicated Databases," Proc. Second ACM Symp. Principles of Distributed Computing, pp. 114-122, Aug. 1983.
[4] K. Birman, "Replication and Fault-Tolerance in the ISIS System," Proc. 10th ACM Symp. Operating Systems Principles, pp. 79-86, Dec. 1985.
[5] A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swinehart, and D. Terry, Epidemic Algorithms for Replicated Database Maintenance Proc. Sixth ACM Symp. Principles of Distributed Computing, 1987.
[6] D. Duchamp,“Analysis of transaction management performance,”inProc. 12th ACM Symp. Operating Systems Principles, Dec. 1989, pp. 177–190.
[7] A. El Abbadi and S. Toueg, "Maintaining Availability in Partitioned Replicated Databases," ACM Trans. Databases Systems, vol. 14, no. 2, pp. 264-290, June 1989.
[8] A. El Abbadi and S. Toue.g., "Availability in Partitioned Replicated Databases (extended abstract)," Proc. Fifth ACM Symp. Principles of Database Systems, pp. 240-251, Mar. 1986.
[9] D.K. Gifford, “Weighted Voting for Replicated Data,” Proc. Seventh ACM SIGOPS Symp. Operating Systems Principles, pp. 150-159, Dec. 1979.
[10] G. Gordon,System Simulation. Englewood Cliffs, NJ: Prentice-Hall, 1978.
[11] M. A. Greer,“Performance measurement of remote IPC”, M.Math thesis, Dep. of Computer Science, Univ. of Waterloo (1989).
[12] M. Herlihy,“Concurrency versus availability: Atomicity mechanisms for replicated data,”ACM Trans. Comput. Syst., 5(3) pp. 249–274, Aug. 1987.
[13] M. Herlihy, "Dynamic Quorum Adjustment for Partitioned Data," ACM Trans. Database Systems, vol. 12, no. 2, pp. 170-194, June 1987.
[14] M. Herlihy, "A Quorum-Consensus Replication Method for Abstract Data Types," ACM Trans. Computer Systems, vol. 4, no. 1, pp. 32-53, Feb. 1986.
[15] ISIS, Modelling Communication Costs, discussion in the comp.sys.isis newsgroup, 1990.
[16] T. A. Joseph and K. Birman,“Low cost management of replicated data in fault-tolerant distributed systems,”ACM Trans. Comput. Syst., 4(1) pp. 54–70, Feb. 1986.
[17] W.H. Kohler, "A Survey of Techniques for Synchronization and Recovery in Decentralized Computing Systems," ACM Computing Surveys, vol. 13, no. 2, pp. 149-185, June 1981.
[18] A. Kumar,“Performance analysis of a hierarchical quorum consensus algorithm for replicated objects,”inProc. 10th Int. Conf. Distrib. Comput. Syst., May 1990.
[19] R. Ladin, B. Liskov, and L. Shrira,“A technique for constructing highly available services,”Laboratory for Computer Science, MIT, Tech. Rep. MIT/LCS/TR-409, Jan. 1988.
[20] B. Lampson, "Atomic Transactions," Lecture notes in Computer Science—Distributed Systems: Architecture and Implementation, vol. 105, pp. 246-265. Springer-Verlag, 1981.
[21] D.D.E. Long, "The Management of Replication in a Distributed System," Univ. of California, San Diego, Dept. of Computer Science, PhD thesis (available as technical report from the Univ. of California, Santa Cruz, UCSC-CRL-88-07), 1988.
[22] B.M. Oki and B. Liskov, "Viewstamped Replication: A New Primary Copy Method to Support Highly Available Distributed Systems," Proc. Seventh ACM Symp. Principles Distributed Computing, pp. 8-17, Aug. 1988.
[23] B. M. Oki,“Viewstamped replication for highly available distributed systems,”Lab. for Computer Science, Massachusetts Inst. of Technology, Ph.D. thesis, (also published as MIT/LCS/TR-423), Aug. 1988.
[24] C. Papadimitriou, "The Serializability of Concurrent Updates," J. ACM, vol. 26, no. 4, pp. 631-653, 1979.
[25] J-F. Paris,“Voting with witnesses: A consistency scheme for replicated files,”inProc. 6th Int. Conf. Distrib. Comput. Syst., May 1986, pp.606-612.
[26] D. J. Taylor,“How big can an atomic action be,”inProc. 5th Symp. Relia-bility in Distrib. Software and Database Syst., Jan. 1986, pp. 121–124.
[27] P. Triantafillou and D. J. Taylor,“Efficiently maintaining availability in the presence of partitionings in distributed systems,”inProc. 7th Int. Conf. Data Eng., IEEE, Apr. 8–12, 1991, pp. 34–41.
[28] P. Triantafillou, "Employing Replication to Achieve Efficiency and High Availability in Distributed Systems," PhD thesis, Univ. of Waterloo, Canada (available as Research Report CS-91-28), July 1991.
[29] P. Triantafillou and D. J. Taylor,“Multi-class replicated data management: Exploiting replication to improve efficiency,”IEEE Trans. Parallel and Distrib. Syst., pp. 121–138, Feb. 1994.

Index Terms:
availability, concurrency control, distributed computing, partitionings, recovery, replication, transactions
Citation:
Peter Triantafillou, David J. Taylor, "The Location-Based Paradigm for Replication: Achieving Efficiency and Availability in Distributed Systems," IEEE Transactions on Software Engineering, vol. 21, no. 1, pp. 1-18, Jan. 1995, doi:10.1109/32.341843
Usage of this product signifies your acceptance of the Terms of Use.