A self-organized, fault-tolerant and scalable replication scheme for cloud storage

Proceedings of the 1st ACM Symposium on Cloud Computing, SoCC '10

Volumn , Issue , 2010, Pages 205-216

  Bonvin, Nicolas ^a   Papaioannou, Thanasis G ^a   Aberer, Karl ^a  

^a EPFL   (Switzerland)

Author keywords

Decentralized optimization; Equilibrium; Net benefit maximization; Rational strategies

Indexed keywords

BENEFIT MAXIMIZATION; COST-EFFICIENT; DATA CENTERS; DATA CLOUDS; DATA ITEMS; DATA PARTITION; DECENTRALIZED OPTIMIZATION; EXTENSIVE SIMULATIONS; FAULT-TOLERANT; MAINTENANCE COST; OPTIMAL RESOURCE ALLOCATION; OPTIMIZERS; SELF-ORGANIZED; STORAGE REQUIREMENTS; THEORETICAL MODELS;

DISTRIBUTED COMPUTER SYSTEMS; ECONOMICS; MAINTENANCE;

OPTIMIZATION;

EID: 77954911824     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1807128.1807162     Document Type: Conference Paper

References (28)

1. A. Adya, W. J. Bolosky, M. Castro, G. Cermak, R. Chaiken, J. R. Douceur, J. Howell, J. R. Lorch, M. Theimer, and R. P. Wattenhofer. Farsite: federated, available, and reliable storage for an incompletely trusted environment. ACM SIGOPS Operating Systems Review, 36(SI):1-14, 2002.
2. D. Agrawal and A. E. Abbadi. The tree quorum protocol: An efficient approach for managing replicated data. In VLDB '90: Proc. of the 16th International Conference on Very Large Data Bases, pages 243-254, Brisbane, Queensland, Australia, 1990.
3. P. A. Bernstein and N. Goodman. An algorithm for concurrency control and recovery in replicated distributed databases. ACM Transactions on Database Systems, 9(4):596-615, 1984.
4. N. Bonvin, T. G. Papaioannou, and K. Aberer. Dynamic cost-efficient replication in data clouds. In Proc. of the Workshop on Automated Control for Datacenters and Clouds, Barcelona, Spain, June 2009.
5. N. Bonvin, T. G. Papaioannou, and K. Aberer. Cost-efficient and differentiated data availability guarantees in data clouds. In ICDE '10: Proceedings of the 26th IEEE International Conference on Data Engineering, Long Beach, CA, USA, March 2010.
6. F. Chang, J. Dean, S. Ghemawat, W. C. Hsieh, D. A. Wallach, M. Burrows, T. Chandra, A. Fikes, and R. E. Gruber. Bigtable: a distributed storage system for structured data. In Proc. of the Symposium on Operating Systems Design and Implementation, Seattle, Washington, 2006.
7. M. Dahlin, B. B. V. Chandra, L. Gao, and A. Nayate. End-to-end wan service availability. IEEE/ACM Transactions on Networking, 11(2):300-313, 2003.
8. K. Daudjee and K. Salem. Lazy database replication with snapshot isolation. In VLDB '06: Proc. of the 32nd International Conference on Very large data bases, pages 715-726, Seoul, Korea, 2006.
9. G. Decandia, D. Hastorun, M. Jampani, G. Kakulapati, A. Lakshman, A. Pilchin, S. Sivasubramanian, P. Vosshall, and W. Vogels. Dynamo: amazon's highly available key-value store. In Proc. of ACM Symposium on Operating Systems Principles, New York, NY, USA, 2007.
10. C. Dellarocas. Goodwill hunting: An economically efficient online feedback mechanism for environments with variable product quality. In Proc. of the Workshop on Agent-Mediated Electronic Commerce, July 2002.
11. S. Ghemawat, H. Gobioff, and S.-T. Leung. The google file system. In Proc. of Symposium on Operating Systems Principles, pages 29-43, Bolton Landing, NY, USA, 2003.
12. R. Gummadi, S. Gribble, S. Ratnasamy, S. Shenker, and I. Stoica. The impact of dht routing geometry on resilience and proximity, 2003.
13. R. G. Guy, J. S. Heidemann, and J. T. W. Page. The ficus replicated file system. ACM SIGOPS Operating Systems Review, 26(2):26, 1992.
14. G. Heiser, F. Lam, and S. Russell. Resource management in the mungi single-address-space operating system. In Proc. of Australasian Computer Science Conference, Perth, Australia, February 1998.
15. R. Honicky and E. L. Miller. A fast algorithm for online placement and reorganization of replicated data. In Proc. of Int. Symposium on Parallel and Distributed Processing, Nice, France, April 2003.
16. D. Karger, E. Lehman, T. Leighton, M. Levine, D. Lewin, and R. Panigrahy. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web. In Proc. of ACM Symposium on Theory of Computing, pages 654-663, May 1997.
17. J. Kubiatowicz, D. Bindel, Y. Chen, S. Czerwinski, P. Eaton, D. Geels, R. Gummadi, S. Rhea, H. Weatherspoon, W. Weimer, C. Wells, and B. Zhao. Oceanstore: an architecture for global-scale persistent storage. SIGPLAN Not., 35(11):190-201, 2000.
18. L. Lamport. The part-time parliament. ACM Transactions on Computer Systems, 16(2):133-169, 1998.
19. W.-S. Li., V. S. Batra, V. Raman, W. Han, and I. Narang. Qos-based data access and placement for federated systems. In VLDB '05: Proceedings of the 31st International Conference on Very Large Data Bases, pages 1358-1362, Trondheim, Norway, 2005.
20. W. Litwin and T. Schwarz. Lh*rs: a high-availability scalable distributed data structure using reed solomon codes. ACM SIGMOD Record, 29(2):237-248, 2000.
21. K. Petersen, M. Spreitzer, D. Terry, and M. Theimer. Bayou: replicated database services for world-wide applications. In Proc. of the 7th workshop on ACM SIGOPS European workshop, Connemara, Ireland, 1996.
22. E. Pinheiro, W.-D. Weber, and L. A. Barroso. Failure trends in a large disk drive population. In Proc. of 5th USENIX Conference on File and Storage Technologies (FAST '07), San Jose, CA, USA, February 2007.
23. A. Rowstron and P. Druschel. Storage management and caching in past, a large-scale, persistent peer-to-peer storage utility. In Proc. of ACM Symposium on Operating Systems Principles, Banff, Alberta, Canada, 2001.
24. M. Satyanarayanan, J. J. Kistler, P. Kumar, M. E. Okasaki, E. H. Siegel, and D. C. Steere. Coda: a highly available file system for a distributed workstation environment. Transactions on Computers, 39(4):447-459, 1990. (Pubitemid 20702255)
25. M. Shapiro, P. Dickman, and D. Plainfossè. Robust, distributed references and acyclic garbage collection. In Proc. of the Symposium on Principles of Distributed Computing, Vancouver, Canada, August 1992.
26. H. Stockinger, K. Stockinger, E. Schikuta, and I. Willers. Towards a cost model for distributed and replicated data stores. In Proc. of Euromicro Workshop on Parallel and Distributed Processing, Italy, February 2001.
27. M. Stonebraker, R. Devine, M. Kornacker, W. Litwin, A. Pfeffer, A. Sah, and C. Staelin. An economic paradigm for query processing and data migration in mariposa. In Proc. of Parallel and Distributed Information Systems, Austin, TX, USA, September 1994.
28. T. Pitoura, N. Ntarmos and P. Triantafillou. Replication, Load Balancing and Efficient Range Query Processing in DHTs. In Proc. of Int. Conference on Extending Database Technology, Munich, Germany, March 2006.