Consistent and Automatic Replica Regeneration

ACM Transactions on Storage

Volumn 1, Issue 1, 2005, Pages 3-37

  Yu, Haifeng ^a   Vahdat, Amin ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Algorithms; availability; consistency; Design; Experimentation; Peer to peer storage systems; regeneration; Reliability; replication

Indexed keywords

EID: 85009706278     PISSN: 15533077     EISSN: 15533093     Source Type: Journal    
DOI: 10.1145/1044956.1044958     Document Type: Article

References (49)

1. Adya, A., Bolosky, W. J., Castro, M., Cermak, G., Chaiken, R., Douceur, J. R., Howell, J., Lorch, J. R., Theimer, M., and Wattenhofer, R. P. 2002. FARSITE: Federated, available, and reliable storage for an incompletely trusted environment. In Proceedings of the 5th Symposium on Operating Systems Design and Implementation
2. Amir, Y., Dolev, D., Kramer, S., and Malki, D. 1992. Transis: A communication subsystem for high availability. In Proceedings of the 22nd International Symposium on Fault Tolerant Computing. 76-84
3. Andersen, D., Balakrishnan, H., Kaashoek, F., and Morris, R. 2001. Resilient overlay networks. In Proceedings of the 18th Symposium on Operating Systems Principles (SOSP)
4. Aspnes, J. and Waarts, O. 1996. Randomized consensus in expected O(n logn) operations per processor. SIAM J. Comput. 25, 5 (Oct.), 1024-1044
5. Babaoglu, O., Bartoli, A., and Dini, G. 1994. Replicated file management in large-scale distributed systems. In Workshop on Distributed Algorithms. 1-16
6. Bartoli, A. and Babaoglu, O. 1997. Selecting a “primary partition” in partitionable asynchronous distributed systems. In Symposium on Reliable Distributed Systems. 138-145
7. Birman, K. and Joseph, T. 1987. Reliable communication in the presence of failures. ACM Trans. Comput. Syst. 5, 47-76
8. Bracha, G. and Rachman, O. 1991. Randomized consensus in expected O(n2logn) operations. In Proceedings of the 5th International Workshop on Distributed Algorithms
9. Brown, A., Chung, L., and Patterson, D. 2002. Including the human factor in dependability benchmarks. In DSN Workshop on Dependability Benchmarking
10. Castro, M. and Liskov, B. 2000. Proactive recovery in a Byzantine-fault-tolerant system. In Proceedings of the 4th Symposium on Operating Systems Design and Implementation (OSDI)
11. Chockler, G. V., Keidar, I., and Vitenberg, R. 2001. Group communication specifications: A comprehensive study. ACM Comput. Surv. 33, 1-43
12. Chow, R. and Johnson, T. 1998. Distributed Operating Systems & Algorithms. Addison Wesley Longman, Inc
13. Cohen, R., Erez, K., Ben Avraham D., and Havlin, S. 2000. Resilience of the Internet to random breakdowns. Phys. Rev. Letters 85, 21 (Nov.)
14. Dabek, F., Kaashoek, M. F., Karger, D., Morris, R., and Stoica, I. 2001. Wide-area cooperative storage with CFS. In Proceedings of the 18th ACM Symposium on Operating Systems Principles
15. Dabek, F., Zhao, B., Druschel, P., Kubiatowicz, J., and Stoica, I. 2003. Towards a common API for structured peer-to-peer overlays. In Proceedings of the 2nd International Workshop on Peer-to-Peer Systems
16. Dahlin, M., Chandra, B., Gao, L., and Nayate, A. 2003. End-to-end WAN service availability. ACM/IEEE Trans. Network. 11, 2 (April)
17. Fox, A., Gribble, S., Chawathe, Y., and Brewer, E. 1997. Cluster-based scalable network services. In Proceedings of the 16th ACM Symposium on Operating Systems Principles. Saint-Malo, France
18. Gafni, E. and Lamport, L. 2000. Disk paxos. In Proceedings of the International Symposium on Distributed Computing. 330-344
19. Gilbert, S., Lynch, N., and Shvartsman, A. 2003. RAMBO II: Rapidly reconfigurable atomic memory for dynamic networks. In Proceedings of the International Conference on Dependable Systems and Networks (DSN)
20. Goldberg, M. K. 1966. The diameter of a strongly connected graph (Russian). Doklady 170, 4
21. Gray, C. and Cheriton, D. 1989. Leases: An efficient fault-tolerant mechanism for distributed file cache consistency. In Proceedings of the 12th ACM Symposium on Operating Systems Principles. 202-210
22. Herlihy, M. and Wing, J. 1990. Linearizability: A correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12, 3 (July)
23. Kaashoek, M. F. and Tanenbaum, A. S. 1991. Group communication in the Amoeba distributed operating system. In Proceedings of the 10th International Conference on Distributed Computing Systems. 222-230
24. Keidar, I. and Dolev, D. 1995. Increasing the resilience of atomic commit, at no additional cost. In Proceedings of the ACM Symposium of Principles of Database Systems
25. Kubiatowicz, J., Bindel, D., Chen, Y., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., Wells, C., and Zhao, B. 2000. OceanStore: An architecture for global-scale persistent storage. In Proceedings of ACM ASPLOS
26. Lamport, L. 1998. The part-time parliament. ACM Trans. Comput. Syst. 16, 133-169
27. Lynch, N. 1997. Distributed algorithms. Morgan Kaufmann Publishers
28. Lynch, N. and Shvartsman, A. 2002. RAMBO: A reconfigurable atomic memory service for dynamic networks. In Proceedings of the 16th International Symposium on Distributed Computing (DISC)
29. Mishra, S., Peterson, L., and Schlichting, R. 1993. Consul: A communication substrate for fault-tolerant distributed programs. Distrib. Syst. Engineer. 1, 87-103
30. Muthitacharoen, A., Morris, R., Gil, T., and Chen, B. 2002. Ivy: A read/write peer-to-peer file system. In Proceedings of the 5th Symposium on Operating Systems Design and Implementation
31. Paris, J.-F. 1986. Voting with Witnesses: A consistency scheme for replicated files. In Proceedings of the 6th International Conference on Distributed Computer Systems. 606-612
32. Peterson, L., Anderson, T., Culler, D., and Roscoe, T. 2002. A blueprint for introducing disruptive technology into the internet. In Proceedings of the ACM HotNets-I Workshop
33. Prisco, R. D., Fekete, A., Lynch, N., and Shvartsman, A. 1999. A dynamic primary configuration group communication service. In Proceedings of the 13th International Symposium on Distributed Computing (DISC)
34. Renesse, R., Birman, K., Cooper, R., Glade, B., and Stephenson, P. 1993. The Horus System. In Reliable Distributed Computing with the Isis Toolkit, K. P. Birman and R. van Renesse, Eds. 133-147
35. Rhea, S., Eaton, P., Geels, D., Weatherspoon, H., Zhao, B., and Kubiatowicz, J. 2003. Pond: the oceanstore prototype. in Proceedings of the 2nd USENIX Conference on File and Storage Technologies
36. Ricciardi, A. and Birman, K. 1991. Using process groups to implement failure detection in asynchronous environments. In Proceedings of the 10th ACM Symposium of Principles of Distributed Computing. 341-352
37. Rowstron, A. and Druschel, P. 2001a. Pastry: scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proceedings of the 18th IFIP/ACM International Conference on Distributed Systems Platforms (Middleware 2001)
38. Rowstron, A. and Druschel, P. 2001b. Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. In Proceedings of the 18th ACM Symposium on Operating Systems Principles. 188-201
39. Sahner, R. A., Trivedi, K. S., and Puliafito, A. 1996. Performance and Reliability Analysis of Computer Systems. Kluwer Academic Publishers
40. Saito, Y., Bershad, B., and Levy, H. 1999. Manageability, availability and performance in Porcupine: A highly scalable internet mail service. In Proceedings of the 17th ACM Symposium on Operating Systems Principles
41. Saito, Y., Karamanolis, C., Karlsson, M., and Mahalingam, M. 2002. Taming aggressive replication in the Pangaea wide-area file system. In Proceedings of the 5th Symposium on Operating Systems Design and Implementation
42. Saks, M., Shavit, N., and Woll, H. 1991. Optimal time randomized consensus-Making resilient algorithms fast in practice. in Proceedings of the 2nd Symposium on Discrete Algorithms. 351-362
43. Schiper, A. and Sandoz, A. 1994. Primary partition “virtually-synchronous communication” harder than consensus. In Proceedings of the 8th International Workshop on Distributed Algorithms (WDAG-8). 39-52
44. Schneider, F. B. 1990. Implementing fault-tolerant services using the state machine approach: Atutorial. ACM Comput. Surv., 299-319
45. Skeen, D. 1982. A quorum-based commit protocol. In Proceedings of the Berkeley Workshop on Distributed Data Management and Computer Network
46. Stoica, I., Morris, R., Karger, D., Kaashoek, F., and Balakrishnan, H. 2001. Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of the ACM SIGCOMM 2001. 149-160
47. Venkataramani, A., Kokku, R., and Dahlin, M. 2002. TCP nice: A mechanism for background transfers. In Proceedings of the Symposium on Operating Systems Design and Implementation (OSDI)
48. Yu, H. 2003. Overcoming the majority barrier in large-scale systems. In Proceedings of the 17th International Symposium on Distributed Computing (DISC)
49. Yu, H. and Vahdat, A. 2001. The costs and limits of availability for replicated services. In Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP)