The costs and limits of availability for replicated services

Operating Systems Review (ACM)

Volumn 35, Issue 5, 2001, Pages 29-42

  Yu, Haifeng ^a   Vahdat, Amin ^b  

^a INTEL RESEARCH   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AVAILABILITY; INTERNET; NETWORK PROTOCOLS; OPTIMIZATION;

CONSISTENCY PROTOCOL; REMOTE SERVICES;

TELECOMMUNICATION SERVICES;

EID: 0036041799     PISSN: 01635980     EISSN: None     Source Type: Journal    
DOI: 10.1145/502059.502038     Document Type: Article

References (40)

1. A. Adya, B. Liskov, and P. O'Neil. Generalized Isolation Level Definitions. In Proceedings of the IEEE International Conference on Data Engineering, March 2000.
2. Y. Amir and A. Wool. Evaluating Quorum Systems over the Internet. In Proceedings of the Annual International Symposium on Fault-Tolerant Computing, June 1996.
3. M. Baker, J. Hartman, M. Kupfer, K. Shirriff, and J. Ousterhout. Measurements of a Distributed File System. In Proceedings of the 13th ACM Symposium on Operating Systems Principles, pages 198-212, Oct. 1991.
4. D. Barbara and H. Garcia-Molina. The Vulnerability of Vote Assignments. ACM Transactions on Database Systems, August 1986.
5. P. Bernstein, V. Hadzilacos, and N. Goodman. Concurrency Control and Recovery in Database Systems. Addison-Wesley, 1987.
6. A. Brown and D. Patterson. Towards Maintainability, Availability, and Growth Benchmarks: A Case Study of Software RAID Systems. In Proceedings of the 2000 USENIX Annual Technical Conference, June 2000.
7. U. Cetintemel, P. Keleher, and M. Franklin. Support for Speculative Update Propagation and Mobility in Deno. In Proceedings of the 21st IEEE International Conference on Distributed Computing Systems, April 2001.
8. B. Chandra, M. Dahlin, L. Gao, and A. Nayate. End-to-End WAN Service Availability. In Proceedings of the 3rd Usenix Symposium on Internet Technologies and Systems, January 2001.
9. B. Coan, B. Oki, and E. Kolodner. Limitations on Database Availability When Networks Partition. In Proceedings of the 5th ACM Symposium on Principle of Distributed Computing, pages 187-194, August 1986.
10. J. Czyzyk, S. Mehrotra, M. Wagner, and S. Wright. PCx: Software for Linear Programming. Available at: http://www-fp.mes.anl.gov/otc/Tools/PCx/.
11. K. Diks, E. Kranakis, D. Krizanc, B. Mans, and A. Pelc. Optimal Coteries and Voting Schemes. Information Processing Letters, pages 1-6, 1994.
12. M. Faloutsos, P. Faloutsos, and C. Faloutsos. On Power-law Relationships of the Internet Topology. In SIGCOMM, 1999.
13. A. Fox and E. Brewer. Harvest, Yield, and Scalable Tolerant Systems. In Proceedings of HotOS-VII, March 1999.
14. A. Fox, S. Gribble, Y. Chawathe, and E. Brewer. Cluster-Based Scalable Network Services. In Proceedings of the 16th ACM Symposium on Operating Systems Principles, Saint-Malo, France, October 1997.
15. D. K. Gifford. Weighted Voting for Replicated Data. In Proceedings of the 7th SOSP, 1979.
16. R. Golding. A Weak-Consistency Architecture for Distributed Information Services. Computing Systems, 5(4):379-405, Fall 1992.
17. J. Gray, P. Heiland, P. E. O'Neil, and D. Shasha. The Dangers of Replication and a Solution. In Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, June 1996.
18. J. Hennessy. The Future of Systems Research. IEEE Computer, 32(8):27-33, August 1999.
19. D. B. Johnson and L. Raab. A Tight Upper Bound on the Benefits of Replication and Consistency Control Protocols. In Proceedings of the 10th ACM Symposium on Principles of Database Systems, May 1991.
20. P. Keleher. Decentralized Replicated-Object Protocols. In Proceedings of the 18th Annual ACM Symposium on Principles of Distributed Computing, April 1999.
21. J. J. Kistler and M. Satyanarayanan. Disconnected Operation in the Coda File System. ACM Transactions on Computer Systems, 10(1):3-25, Feb. 1992.
22. N. Krishnakumar and A. Bernstein. Bounded Ignorance: A Technique for Increasing Concurrency in a Replicated System. ACM Transactions on Database Systems, 19(4), December 1994.
23. A. Kumar and A. Segev. Cost and Availability Tradeoffs in Replicated Data Concurrency Control. ACM Transactions on Database Systems, March 1993.
24. R. Ladin, B. Liskov, L. Shrira, and S. Ghemawat. Providing High Availability Using Lazy Replication. ACM Transactions on Computer Systems, 10(4):360-391, November 1992.
25. B. Lampson. How to Build a Highly Available System Using Consensus. In Distributed Algorithms, Lecture Notes in Computer Science 1151. Springer, 1996.
26. L. Mummert. Exploiting Weak Connectivity in a Distributed File System. PhD thesis, Carnegie Mellon University, December 1996.
27. B. Noble, B. Fleis, and M. Kim. A Case for Fluid Replication. In Proceedings of the 1999 Network Storage Symposium (Netstore), October 1999.
28. B. Noble, M. Satyananarayanan, G. Nguyen, and R. Katz. Trace-based Mobile Network Emulation. In Proceedings of SIGCOMM, September 1997.
29. T. Page, R. Guy, J. Heidemann, D. Ratner, A. Goel, G. Kuenning, and G. Popek. Perspectives on Optimistically Replicated Peer-to-Peer Filing. Software-Practice and Experience, 28(2):155-180, February 1998.
30. V. Paxson. End-To-End Routing Behavior in the Internet. In Proceedings of the ACM SIGCOMM '96 Conference on Communications Architectures and Protocols, August 1996.
31. K. Petersen, M. Spreitzer, D. Terry, M. Theimer, and A. Demers. Flexible Update Propagation for Weakly Consistent Replication. In Proceedings of the 16th ACM Symposium on Operating Systems Principles (SOSP-16), October 1997.
32. C. Pu and A. Leff. Replication Control in Distributed System: An Asynchronous Approach. In Proceedings of the ACM SIGMOD Conference on Management of Data, May 1991.
33. Y. Saito, B. Bershad, and H. Levy. Manageability, Availability and Performance in Porcupine: A Highly Scalable Internet Mail Service. In Proceedings of the 17th A CM Symposium on Operating Systems Principles, December 1999.
34. S. Savage, A. Collins, E. Hoffman, J. Snell, and T. Anderson. The End-to-End Effects of Internet Path Selection. In SIGCOMM, 1999.
35. D. B. Terry, M. M. Theimer, K. Petersen, A. J. Demers, M. J. Spreitzer, and C. H. Hauser. Managing Update Conflicts in Bayou, a Weakly Connected Replicated Storage System. In Proceedings of the Fifteenth ACM Symposium on Operating Systems Principles, Dec. 1995.
36. H. Yu and A. Vahdat. Design and Evaluation of a Continuous Consistency Model for Replicated Services. In Proceedings of Operating Systems Design and Implementation (OSDI), October 2000.
37. H. Yu and A. Vahdat. Efficient Numerical Error Bounding for Replicated Network Services. In Proceedings of the 26th International Conference on Very Large Databases (VLDB), September 2000.
38. H. Yu and A. Vahdat. Combining Generality and Practicality in a Conit-Based Continuous Consistency Model for Wide-Area Replication. In The 21st IEEE International Conference on Distributed Computing Systems (ICDCS), April 2001.
39. H. Yu and A. Vahdat. The Costs and Limits of Availability for Replicated Services. Technical Report CS-2001-03, Duke University, July 2001. Available from http://www.cs.duke.adu/˜vahdat/ps/tr-cs-2001-03.pdf.
40. E. W. Zegura, K. Calvert, and M. J. Donahoo. A Quantitative Comparison of Graph-Based Models for Internet Topology. IEEE/ACM Transactions on Networking, 5(6), December 1997.