Optimistic replication

ACM Computing Surveys

Volumn 37, Issue 1, 2005, Pages 42-81

  Saito, Yasushi ^a   Shapiro, Marc ^b  

^a HEWLETT PACKARD LABORATORIES   (United States)

^b MICROSOFT RESEARCH   (United Kingdom)

Author keywords

Disconnected operation; Distributed systems; Large scale systems; Optimistic techniques; Replication

Indexed keywords

ALGORITHMS; LARGE SCALE SYSTEMS; MOBILE TELECOMMUNICATION SYSTEMS; TELECOMMUNICATION LINKS;

DISCONNECTED OPERATION; OPTIMISTIC REPLICATION ALGORITHMS; OPTIMISTIC TECHNIQUES; REPLICATION;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 24344439365     PISSN: 03600300     EISSN: None     Source Type: Journal    
DOI: 10.1145/1057977.1057980     Document Type: Review

References (140)

1. ADLY, N. 1995. Management of replicated data in large scale systems. Ph.D. thesis, Corpus Cristi College, University of Cambridge.
2. ADYA, A. AND LISKOV, B. 1997. Lazy consistency using loosely synchronized clocks. In 16th Symposium on Principles of Distributed Computing (PODC). Santa Barbara, CA. 73-82.
3. AGRAWAL, D., ABBADI, A. E., AND STEIKE, R. C. 1997. Epidemic algorithms in replicated databases. In 16th Symposium on Principles of Database Systems (PODS). Tucson, AZ. 161-172.
4. ALBITZ, P. AND LIU, C. 2001. DNS and BIND, 4th Ed. O'Reilly & Associates. Sebastopol, CA. ISBN 0-596-00158-4.
5. ALMEIDA, P. S., BAQUERO, C., AND FONTE, V. 2000. Panasync: Dependency tracking among file copies. In 9th ACM SIGOPS European Workshop, P. Guedes, Ed. Kolding, Denmark. 7-12.
6. ALMEIDA, P. S., BAQUERO, C., AND FONTE, V. 2002. Version stamps - decentralized version vectors. In 22nd International Conference on Distributed Computing Systems (ICDCS). Vienna, Austria. 544-551.
7. ALONSO, R., BARBARA, D., AND GARCIA-MOLINA, H. 1990. Data caching issues in an information retrieval system. ACM Trans. Datab. Syst. 15, 3 (Sept.), 359-384.
8. BAKER, M., HARTMAN, J. H., KUPFER, M. D., SHIRRIFF, K., AND OUSTERHOUT, J. K. 1991. Measurements of a distributed file system. In 13th Symposium on Operating Systems Principles (SOSP). Pacific Grove, CA. 198-212.
9. BALASUBRAMANIAM, S. AND PIERCE, B. C. 1998. What is a file synchronizer? In 4th International Con ference on Mobile Computing and Networking (MOBICOM). ACM/IEEE. Delias, TX.
10. BERNSTEIN, P. A. AND GOODMAN, N. 1983. The failure and recovery problem for replicated databases. In 2nd Symposium on Principles of Distributed Computing (PODC). Montréal, QC, Canada. 114-122.
11. BERNSTEIN, P. A., HADZILACOS, V., AND GOODMAN, N. 1987. Concurrency Control and Recovery in Database Systems. Addison Wesley, Boston, MA. Available at http://research.microsoft.com/pubs/ccontrol/.
12. BIRMAN, K. P., HAYDEN, M., OZKASAP, O., XIAO, Z., BUDIU, M., AND MINSKY, Y. 1999. Bimodal multicast. ACM Trans. Comp. Syst. 17, 2, 41-88.
13. BIRMAN, K. P. AND JOSEPH, T. A. 1987. Reliable communication in the presence of failures. ACM Trans. Comp. Syst. 5, 1 (Feb.), 272-314.
14. BIRRELL, A. D., LEVIN, R., NEEDHAM, R. M., AND SCHROEDER, M. D. 1982. Grapevine: An exercise in distributed computing. Comm. ACM 25, 4 (Feb.), 260-274.
15. BOLINGER, D. AND BRONSON, T. 1995. Applying RCS and SCCS. O'Reilly & Associates, Sebastopol, CA.
16. CARTER, J., RANGANATHAN, A., AND SUSARLA, S. 1998. Khazana: An infrastructure for building distributed services. In 18th International Conference on Distributed Computer Systems (ICDCS). Amsterdam, The Netherlands. 562-571.
17. CEDERQVIST, P., PESCH, R., ET AL. 2001. Version management with CVS. Available at http://www.cvsh.ome.org/docs/manual.
18. CHANDRA, B., DAHLIN, M., GAO, L., AND NAYATE, A. 2001. End-to-end WAN service availability. In 3rd USENIX Symposium on Internet Technology and Systems (USITS). San Francisco, CA.
19. CHANDRA, T.D. AND TOUEG, S. 1996. Unreliable failure detectors for reliable distributed systems. J. ACM 43, 2 (Mar.), 225-267.
20. CHANKHUNTHOD, A., DANZIG, P. B., NEERDAELS, C., SCHWARTZ, M. F., AND WORRELL, K. J. 1996. A hierarchical internet object cache. In USENIX Winter Technical Conference. San Diego, CA. 153-164.
21. CHARRON-BOST, B. 1991. Concerning the size of logical clocks in distributed systems. Information Processing Letters 39, 1 (July), 11-16.
22. CHEN, Y., EDLER, J., GOLDBERG, A., GOTTLIEB, A., SOBTI, S., AND YIANILOS, P. N. 1999. A prototype implementation of archival intermemory. In Fourth ACM Conference on Digital Libraries (DL'99). ACM, Berkeley CA. 28-37.
23. CHO, J. AND GARCIA-MOLINA, H. 2000. Synchronizing a database to improve freshness. In International Conference on Management of Data (SIGMOD). Dallas, TX. 117-128.
24. CORMACK, G. V. 1995. A calculus for concurrent update. Tech. Rep. CS-95-06, University of Waterloo.
25. COX, L. P. AND NOBLE, B. D. 2001. Fast reconciliations in fluid replication. In 21st International Conference on Distributed Computer Systems (ICDCS). Phoenix, AZ.
26. DE TORRES-ROJAS, F. AND AHAMAD, M. 1996. Plausible clocks: Constant size logical clocks for distributed systems. In 10th International Workshop on Distributed Algorithms (WDAG). Bologna, Italy.
27. DEERING, S. E. 1991. Multicast routing in a datagram internetwork. Ph.D. thesis, Stanford University.
28. DEMERS, A. J., GREENE, D. H., HAUSER, C., IRISH, W., AND LARSON, J. 1987. Epidemic algorithms for replicated database maintenance. In 6th Symposium on Principles of Distributed Computing (PODC). Vancouver, BC, Canada. 1-12.
29. DIETTERICH, D. J. 1994. DEC data distributor: For data replication and data warehousing. In International Conference on Management of Data (SIGMOD). ACM, Minneapolis, MN. 468.
30. ELLIS, C. A. AND GIBBS, S. J. 1989. Concurrency control in groupware systems. In International Conference on Management of Data (SIGMOD). Portland, OR.
31. ELMAGARMID, A. K., Ed. 1992. Database Transaction Models for Advanced Applications. Morgan Kaufmann, San Francisco, CA.
32. ELSON, J., GIROD, L., AND ESTRIN, D. 2002. Finegrained network time synchronization using reference broadcasts. In 5th Symposium on Operating Systems Design and Implementation (OSDI). Boston, MA.
33. FEKETE, A., GUPTA, D., LUCHANGCO, V., LYNCH, N., AND SHVARTSMAN, A. 1999. Eventually serializable data services. Theor. Comput. Sci. 220: Special issue on Distributed Algorithms, 113-156.
34. FEKETE, A., LYNCH, N., AND SHVARTSMAN, A. 1997. Specifying and using a partitionable group communication service. In 16th Symposium on Principles of Distributed Computing (PODC). Santa Barbara, CA. 53-62.
35. FIDGE, C. J. 1988. Timestamps in message-passing systems that preserve the partial ordering. In 11th Australian Computer Science Conference. University of Queensland, Australia. 55-66.
36. FIELDING, R., GETTYS, J., MOGUL, J., FRYSTYK, H., MASINTER, L., LEACH, P., AND BERNERS-LEE, T. 1999. RFC2616: Hypertext transfer protocol-HTTP/1.1. Available at http://www.faqs.org/rfcs/rfc2616.html.
37. FISCHER, M. J., LYNCH, N. A., AND PATERSON, M. S. 1985. Impossibility of distributed consensus with one faulty process. J. ACM 32, 2, 374-382.
38. FISCHER, M. J. AND MICHAEL, A. 1982. Sacrificing serializability to attain availability of data in an unreliable network. In 1st Symposium on Principles of Database Systems (PODS). Los Angeles, CA. 70-75.
39. FLOYD, S., JACOBSEN, V., LIU, C.-G., MCCANNE, S., AND ZHANG, L. 1997. A reliable multicast framework for light-weight sessions and application level framing. IEEE / ACM J. Netw. 5, 6 (Dec.), 784-803.
40. FOX, A. AND BREWER, E. A. 1999. Harvest, yield, and scalable tolerant systems. In 6th Workshop on Hot Topics in Operating Systems (HOTOS-VI). Rio Rico, AZ. 174-178.
41. GIFFORD, D. K. 1979. Weighted voting for replicated data. In 7th Symposium on Operating Systems Principles (SOSP). Pacific Grove, CA. 150-162.
42. GOLDING, R. A. 1992. Weak-consistency group communication and membership. Ph.D. thesis. Tech. Report no. UCSC-CRL-92-52. University of California Santa Cruz, CA.
43. GRAY, J., HELLAND, P., O'NEIL, P., AND SHASHA, D. 1996. Dangers of replication and a solution. In International Conference on Management of Data (SIGMOD). Montréal, Canada. 173-182.
44. GRAY, J. AND REUTER, A. 1993. Transaction Processing: Concepts and Techniques. Morgan Kaufmann, San Francisco, CA.
45. GUY, R. G., POPEK, G. J., AND PAGE, T. W., JR. 1993. Consistency algorithms for optimistic replication. In Proceedings to 1st IEEE International Conference on Network Protocols. San Francisco, CA.
46. HEDETNIEMI, S., HEDETNIEMI, S., AND LIESTMAN, O. 1988. A survey of gossiping and broadcasting in communication networks. Networks 18, 319-349.
47. HERLIHY, M. P. AND WING, J. M. 1990. Linearizability: A correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12, 3, 463-492.
48. JAGADISH, H. V., MUMICK, I. S., AND RABINOVICH, M. 1997. Scalable versioning in distributed databases with commuting updates. In 13th International Conference on Data Engineering (ICDE). Birmingham, U.K. 520-531.
49. JOHNSON, P. R. AND THOMAS, R. H. 1976. RFC677: The maintenance of duplicate databases. Available at http://www.faqs.org/rfcs/rfc677.html.
50. JOHNSON, T. AND JEONG, K. 1996. Hierarchical matrix timestamps for scalable update propagation. Tech. Rep. (June). TR96-017, University of Florida.
51. KANG, B. B., WILENSKY, R., AND KUBIATOWICZ, J. 2003. The hash history approach for reconciling mutual inconsistency. In 23rd International Conference on Distributed Computer Systems (ICDCS). Providence, RI.
52. KANTOR, B. AND RAPSEY, P. 1986. RFC977: Network news transfer protocol. Available at http://www.faqs.org/rfcs/rfc977.html.
53. KAWELL, L., JR., BECKHART, S., HALVORSEN, T., OZZIE, R., AND GREIF, I. 1988. Replicated document management in a group communication system. In Conference on Computer Supported Cooperative Work (CSCW). Chapel Hill, NC.
54. KELEHER, P. J. 1999. Decentralized replicated-object protocols. In 18th Symposium on Principles of Database Computing (PODC). Atlanta, GA. 143-151.
55. KEMPE, D., KLEINBERG, J., AND DEMERS, A. 2001. Spatial gossip and resource location protocols. In 33rd Symposium on Theory of Computing (STOC). Crete, Greece.
56. KERMARREC, A.-M., ROWSTRON, A., SHAPIRO, M., AND DRUSCHEL, P. 2001. The IceCube approach to the reconciliation of diverging replicas. In 20th Symposium on Principles of Distributed Computing (PODC). Newport, RI.
57. KIM, M., Cox, L. P., AND NOBLE, B. D. 2002. Safety, visibility, and performance in a wide-area file system. In USENIX Conference on File and Storage Technologies (FAST). Monterey, CA.
58. KISTLER, J. J. AND SATYANARAYANAN, M. 1992. Disconnected operation in the Coda file system. ACM Trans. Comput. Syst. 10, 5 (Feb.), 3-25.
59. KRASEL, C. 2000. Leafnode: An NNTP server for small sites. Available at http://www.leafnode. org.
60. KRISHNAKUMAR, N. AND BERNSTEIN, A. 1994. Bounded ignorance: A technique for increasing concurrency in replicated systems. ACM Trans Datab. Syst. 19, 4 (Dec.), 685-722.
61. KUMAR, A. AND STONEBRAKER, M. 1988. Semantic based transaction management techniques for replicated data. In International Conference on Management of Data (SIGMOD). Chicago, II. 117-125.
62. KUMAR, A. AND STONEBRAKER, M. 1990. An analysis of borrowing policies for escrow transactions in a replicated environment. In 6th International Conference on Data Engineering (ICDE). Los Angeles, CA. 446-454.
63. KUMAR, P. AND SATYANARAYANAN, M. 1993. Log-based directory resolution in the coda file system. In 2nd International Confernce on Parallel and Distributed Information Systems (PDIS). San Diego, CA. 202-213.
64. KUMAR, P. AND SATYANARAYANAN, M. 1995. Flexible and safe resolution of file conflicts. In USENIX Winter Technical Conference. New Orleans, LA. 95-106.
65. LADIN, R., LISKOV, B., SHRIRA, L., AND GHEMAWAT, S. 1990. Lazy replication: Exploiting the semantics of distributed services. Tech. Rep. TR-484 (July). MIT LCS.
66. LADIN, R., LISKOV, B., SHRIRA, L., AND GHEMAWAT, S. 1992. Providing high availability using lazy replication. ACM Trans. Comput. Syst. 10, 4, 360-391.
67. LAMPORT, L. 1978. Time, clocks, and the ordering of events in a distributed system. Comm. ACM 21, 1 (July), 558-565.
68. LAWRENCE, N. D., ROWSTRON, A. I. T., BISHOP, C. M., AND TAYLOR, M. J. 2002. Optimising synchronisation times for mobile devices. In Advances in Neural Information Processing Systems, T. G. Dietterich, S. Becker, and Z. Ghahramani, Eds. Vol. 14. MIT Press, Cambridge, MA. 1401-1408.
69. LEE, Y.-W., LEUNG, K.-S., AND SATYANARAYANAN, M. 2002. Operation shipping for mobile file systems. IEEE Trans. Comput. 51, 1410-1422.
70. LIDL, K., OSBORNE, J., AND MALCOLM, J. 1994. Drinking from the firehose: Multicast USENET news. In USENIX Winter Technical Conference. San Francisco, CA. 33-45.
71. LIN, M. J. AND MARZULLO, K. 1999. Directional gossip: Gossip in a wide-area network. In Third European Dependable Computing Conference. Prague, Czechoslovakia. 364-379.
72. Lu, Q. AND SATYANARAYANAN, M. 1995. Improving data consistency in mobile computing using isolation-only transactions. In 4th Workshop on Hot Topics in Operating Systems (HOTOS-IV). Orcas Island, WA.
73. MATHESON, C. 2003. Personal communication.
74. MATTERN, F. 1989. Virtual time and global states of distributed systems. In International Workshop on Parallel and Distributed Algorithms. Elsevier Science Publishers B.V. (North-Holland). 216-226.
75. MAZIÈRES, D. AND SHASHA, D. 2002. Building secure file systems out of Byzantine storage. In 21st Symposium on Principles of Distribted Computing (PODC). Monterey, CA.
76. MICROSOFT. 2000. Windows 2000 Server: Distributed systems guide. Microsoft Press, Redmond, WA. Chapter 6, 299-340.
77. MILLS, D. L. 1994. Improved algorithms for synchronizing computer network clocks. In ACM SIGCOMM. London, UK. 317-327.
78. MINSKY, Y. 2002. Spread rumors cheaply, quickly and reliably. Ph.D. thesis, Cornell University.
79. MINSKY, Y., TRACHTENBERG, A., AND ZIPFEL, R. 2001. Set reconciliation with nearly optimal communication complexity. In International Symposium on Information Theory. IEEE. Washington, DC.
80. MISHRA, S., PETERSON, L., AND SCHLICHTING, R. 1989. Implementing fault-tolerant replicated objects using Psync. In 8th Symposium on Reliable Distributed Systems (SRDS). Seattle, WA. 42-53.
81. MOCKAPETRIS, P. V. 1987. RFC1035: Domain names-implementation and specification. Available at http://www.faqs.org/rfcs/rfc1035. html.
82. MOCKAPETRIS, P. V. AND DUNLAP, K. 1988. Development of the domain name system. In ACM SIGCOMM. Stanford, CA. 123-133.
83. MOLLI, P., OSTER, G., SKAF-MOLLI, H., AND IMINE, A. 2003. Safe generic data synchronizer. Rapport de recherche A03-R-062 (May). LORIA.
84. MOORE, K. 1995. The lotus notes storage system. In International Conference on Management of Data (SIGMOD). San Jose, CA. 427.
85. MUMMERT, L. B., EBLING, M. R., AND SATYANARAYANAN, M. 1995. Exploiting weak connectivity for mobile file access. In 15th Symposium on Operating Systems Principles (SOSP). Copper Mountain, CO. 143-155.
86. MUTHITACHAROEN, A., CHEN, B., AND MAZIÈRES, D. 2001. A low-bandwidth network file system. In 18th Symposium on Operating Systems Principles (SOSP). Lake Louise, AB, Canada. 174-187.
87. NAKAGAWA, I. 1996. FTPmirror - mirroring directory hierarchy with FTP. Available at http://noc.intec.co.jp/ftpmirror.html.
88. O'NEIL, P. E. 1986. The escrow transactional method. ACM Trans. Datab. Syst. 11, 4, 405-430.
89. Oracle. 1996. Oracle7 Server Distributed Systems Manual, Vol. 2. Oracle.
90. OUSTERHOUT, J. K., DA COSTA, H., HARRISON, D., KUNZE, J. A., KUPFER, M. D., AND THOMPSON, J. G. 1985. A trace-driven analysis of the Unix 4.2 BSD file system. In 10th Symposium on Operating Systems Principles (SOSP). Orcas Island, WA. 15-24.
91. PALMER, C. AND CORMACK, G. 1998. Operation transforms for a distributed shared spread-sheet. In Conference on Computer Supported Cooperative Work (CSCW). Seattle, WA. 69-78.
92. PALMSOURCE, I. 2002. Introduction to conduit development. Available at http://www.palmos.com/dev/support/docs/.
93. PARKER, D. S., POPEK, G., RUDISIN, G., STOUGHTON, A., WALKER, B., WALTON, E., CHOW, J., EDWARDS, D., RISER, S., AND KLINE, C. 1983. Detection of mutual inconsistency in distributed systems. IEEE Trans. Softw. Eng. SE-9, 3, 240-247.
94. PAUL, S., SABNANI, K. K., LIN, J. C., AND BHATTACHARYYA, S. 1997. Reliable multicast transport protocol (RMTP). IEEE J. Select. Areas Comm. 15, 3 (Apr.), 407-421.
95. PEDONE, F. 2001. Boosting system performance with optimistic distributed protocols. IEEE Computer 34, 7 (Dec.), 80-86.
96. PETERSEN, K., SPREITZER, M. J., TERRY, D. B., THEIMER, M. M., AND DEMERS, A. J. 1997. Flexible update propagation for weakly consistent replication. In 16th Symposium on Operating Systems Principles (SOSP). St. Malo, France. 288-301.
97. PREGUIÇA, N., SHAPIRO, M., AND MATHESON, C. 2003. Semantics-based reconciliation for collaborative and environments. In Proceedings of 10th International Conference on Cooperative Information Systems (CoopIS). Catania, Sicily, Italy.
98. PU, C., HSEUSH, W., KAISER, G. E., Wu, K.-L., , AND Yu, P. S. 1995. Divergence control for distributed database systems. Dist. Parall. Datab. 3, 1 (Jan.), 85-109.
99. PU, C., HSEUSH, W., KAISER, G. E., Wu, K.-L., AND Yu, P. S. 1995. Divergence control for distributed database systems. Dist. Parall. Datab. 3, 1 (Jan.), 85-109.
100. PU, C. AND LEFF, A. 1991. Replica control in distributed systems: An asynchronous approach. In International Conference on Management of Data (SIGMOD). Denver, CO. 377-386.
101. RABIN, M. O. 1981. Fingerprinting by random polynomials. Tech. Rep. TR-15-81, Harvard University.
102. RABINOVICH, M., GEHANI, N. H., AND KONONOV, A. 1996. Efficient update propagation in epidemic replicated databases. In International Conference on Extending Database Technology (EDBT). Avignon, France. 207-222.
103. RAMAMRITHAM, K. AND CHRYSANTHIS, P. K. 1996. Executive Briefing: Advances in Concurrency Control and Transaction Processing. IEEE Computer Society. Los Alamitos, CA. ISBN 0818674059.
104. RAMAMRITHAM, K. AND Pu, C. 1995. A formal characterization of epsilon serializability. IEEE Trans. Knowl. Data Eng. 7, 6 (Dec.), 997-1007.
105. RAMSEY, N. AND CSIRMAZ, E. 2001. An algebraic approach to file synchronization. In 9th International Symposium on the Foundations of Software Engineering (FSE). Austria.
106. RATNER, D., REIHER, P., AND POPEK, G. 1997. Dynamic version vector maintenance. Tech. Rep. CSD-970022, UCLA (June).
107. RATNER, D. H. 1998. Roam: A scalable replication system for mobile and distributed computing. Ph.D. thesis, Tech. Report, no. UCLA-CSD-970044. University of California, Los Angeles, CA.
108. RAVIN, E., O'REILLY, T., DOUGHERTY, D., AND TODINO, G. 1996. Using and Managing UUCP. O'Reilly & Associates, Sebastopol, CA.
109. REIHER, P., HEIDEMANN, J. S., RATNER, D., SKINNER, G., AND POPEK, G. J. 1994. Resolving file conflicts in the ficus file system. In USENIX Summer Technical Conference. Boston, MA. 183-195.
110. RHODES, N. AND MCKEEHAN, J. 1998. Palm Programming: The Developer's Guide. O'Reilly & Associates, Sebastopol, CA.
111. SAITO, Y. AND LEVY, H. M. 2000. Optimistic replication for Internet data services. In 14th International Conference on Distributed Computing (DISC). Toledo, Spain. 297-314.
112. SAITO, Y., MOGUL, J., AND VERGHESE, B. 1998. A Usenet performance study. Available at http://www.hpl.hp.com/personal/Yasushi_Saito/ pubs/ne wsbench.ps.
113. SPENCER, H. AND LAWRENCE, D. 1998. Managing Usenet. O'Reilly & Associates, Sebastopol, CA. ISBN 1-56592-198-4.
114. SPREITZER, M. J., THEIMER, M. M., PETERSEN, K., DEMERS, A. J., AND TERRY, D. B. 1997. Dealing with server corruption in weakly consistent, replicated data systems. In 3rd International Conference on Mobile Computing and Networking (MOBICOM). Budapest, Hungary.
115. SPRING, N. T. AND WETHERALL, D. 2000. A protocolindependent technique for eliminating redundant network traffic. In ACM SIGCOMM Stockholm, Sweden.
116. STERN, H., EISLEY, M., AND LABIAGA, R. 2001. Managing NFS and NIS, 2nd Ed. O'Reilly & Associates, Sebastopol, CA. ISBN 1-56592-510-6.
117. SUN, C. AND ELLIS, C. 1998. Operational transformation in real-time group editors: Issues, algorithms, and achievements. In Conference on Computer Supported Cooperative Work (CSCW). Seattle, WA. 59-68.
118. SUN, C., JIA, X., ZHANG, Y., YANG, Y., AND CHEN, D. 1998. Achieving convergence, causality-preservation, and intention-preservation in real-time cooperative editing systems. ACM Trans. Comput.-Hum. Interact. 5, 1 (Mar.), 63-108.
119. SUN, C., YANG, Y., ZHANG, Y., AND CHEN, D. 1996. A consistency model and supporting schemes for real-time cooperative editing systems. In 19th Australian Computer Science Conference. Melbourne, Australia. 582-591.
120. SUN, Q. 2000. Reliable multicast for publish/ subscribe systems. M.S. thesis, MIT.
121. SUN MICROSYSTEMS. 1998. Sun directory services 3.1 administration guide.
122. TERRY, D. B., DEMERS, A. J., PETERSEN, K., SPREITZER, M. J., THEIMER, M. M., AND WELCH, B. B. 1994. Session guarantees for weakly consistent replicated data. In 3rd International Conference on Parallel and Distributed Information Systems (PDIS). Austin, TX. 140-149.
123. TERRY, D. B., THEIMER, M., PETERSEN, K., AND SPREITZER, M. 2000. An examination of conflicts in a weakly-consistent, replicated application. Personal communication.
124. TERRY, D. B., THEIMER, M. M., PETERSEN, K., DEMERS, A. J., SPREITZER, M. J., AND HAUSER, C. H. 1995. Managing update conflicts in Bayou, a weakly connected replicated storage system. In 15th Symposium on Operating Systems Principles (SOSP). Copper Mountain, CO. 172-183.
125. THOMAS, R. H. 1979. A majority consensus approach to concurrency control for multiple copy databases. ACM Trans. Datab. Syst. 4, 2 (June), 180-209.
126. TRIDGELL, A. 2000. Efficient algorithms for sorting and synchronization. Ph.D. thesis, Australian National University.
127. VALOT, C. 1993. Characterizing the accuracy of distributed timestamps. In Workshop on Parallel and Distributed Debugging. 43-52.
128. VESPERMAN, J. 2003. Essential CVS. O'Reilly & Associates, Sebastopol, CA.
129. VIDOT, N., CART, M., FERRI'E, J., AND SULEIMAN, M. 2000. Copies convergence in a distributed real-time collaborative environment. In Conference on Computer Supported Cooperative Work (CSCW). Philadelphia, PA. 171-180.
130. VOGELS, W. 1999. File system usage in Windows NT 4.0. In 17th Symposium on Operating Systems Principles (SOSP). Kiawah Island, SC, USA, 93-109.
131. WALKER, B., POPEK, G., ENGLISH, R., KLINE, C., AND THIEL, G. 1983. The LOCUS distributed operating system. In 9th Symposium on Operating Systems Principles (SOSP). Bretton Woods, NH. 49-70.
132. WANG, A.-I. A., REIHER, P. L., AND BAGRODIA, R. 2001. Understanding the conflict rate metric for peer optimistically replicated filing environments. Submitted for publication.
133. WESSELS, D. AND CLAFFY, K. 1997. RFC2186: Internet Cache Protocol. Available at http://www. faqs.org/rfcs/rfc2186.html.
134. WUU, G. T. J. AND BERNSTEIN, A. J. 1984. Efficient solutions to the replicated log and dictionary problems. In 3rd Symposium on Principles of Distributed Computing (PODC). Vancouver, BC, Canada. 233-242.
135. XTP. 2003. The xpress transport protocol. Available at http://www.ca.sandia.gov/xtp/.
136. YIN, J., ALVISI, L., DAHLIN, M., AND LIN, C. 1999. Hierarchical cache consistency in a WAN. In 2nd USENIX Symposium on Internet Technology and Systems (USITS). Boulder, CO. 13-24.
137. YU, H. AND VAHDAT, A. 2000. Design and evaluation of a continuous consistency model for replicated services. In 4th Symposium on Operating Systems Design and Implementation (OSDI). San Diego, CA. 305-318.
138. Yu, H. AND VAHDAT, A. 2001. The costs and limits of availability for replicated services. In 18th Symposium on Operating Systems Principles (SOSP). Lake Louise, AB, Canada. 29-42.
139. YU, H. AND VAHDAT, A. 2002. Minimal replication cost for availability. In 21st Symposium on Principles of Distributed Computing (PODC). Monterey, CA. 98-107.
140. ZHANG, Y., PAXON, V., ANDSHENKAR, S. 2000. Thestationarity of Internet path properties: Routing, loss and throughput. Tech. rep. (May), ACIRI.