Replication degree customization for high availability

EuroSys'08 - Proceedings of the EuroSys 2008 Conference

Volumn , Issue , 2008, Pages 55-68

  Zhong, Ming ^a   Shen, Kai ^b   Seiferas, Joel ^c  

^a GOOGLE INC   (United States)

^b University of Rochester   (United States)

^c UNIVERSITY OF ROCHESTER   (United States)

Author keywords

Optimization; Replication; System availability

Indexed keywords

A-PRIORI; DATA OBJECTS; DATA SIZES; DISTRIBUTED DATUM; HIGH AVAILABILITIES; MACHINE FAILURES; OBJECT REPLICATIONS; OBJECT SIZES; POPULARITY DISTRIBUTIONS; REAL-LIFE SYSTEMS; REPLICATION; SERVICE AVAILABILITIES; SIZE RATIOS; SPACE CONSTRAINTS; SPACE SAVINGS; STORAGE SYSTEMS; SYSTEM AVAILABILITY;

ALGEBRA; OPTIMIZATION; PROBABILITY;

PROBABILITY DISTRIBUTIONS;

EID: 57549110799     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1352592.1352599     Document Type: Conference Paper

References (37)

1. Ask.com, formerly Ask Jeeves Search. http://www.ask.com.
2. R. Bhagwan, K. Tati, Y. Cheng, S. Savage, and G.M. Voelker. Total recall: System support for automated availability management. In Proc. of the First USENIX Symp. on Networked Systems Design and Implementation, pages 337-350, San Francisco, CA, March 2004.
3. W.J. Bolosky, J.R. Douceur, D. Ely, and M. Theimer. Feasibility of a serverless distributed file system deployed on an existing set of desktop PC. In Proc. of the ACM SIGMETRICS, pages 34-43, Santa Clara, CA, June 2000.
4. M. Castro and B. Liskov. Practical Byzantine fault tolerance. In Proc. of the Third USENIX Symp. on Operating Systems Design and Implementation, New Orleans, LA, February 1999.
5. Chaco. http://www.cs.sandia.gov/~bahendr/chaco.html.
6. E. Cohen and S. Shenker. Replication strategies in unstructured peer-to-peer networks. In Proc. of the ACM SIGCOMM, pages 177-190, Pittsburgh, PA, August 2002.
7. F. Dabek, M.F. Kaashoek, D. Karger, R. Morris, and I. Stoica. Wide-area cooperative storage with CFS. In Proc. of the 18th ACM Symp. on Operating Systems Principles, pages 202-215, Banff, Canada, October 2001.
8. M. Dahlin, B. Chandra, L. Gao, and A. Nayate. End-to-end WAN service availability. ACM/IEEE Tran. on Networking, 11(2):300-313, April 2003.
9. The open directory project. http://www.dmoz.com.
10. J.R. Douceur and R.P. Wattenhofer. Competitive hill-climbing strategies for replica placement in a distributed file system. In Proc. of the 15th Int'l Symp. on Distributed Computing, pages 48-62, Lisboa, Portugal, October 2001.
11. D. Ellard, J. Ledlie, P. Malkani, and M. Seltzer. Passive NFS tracing of email and research workloads. In Proc. of the Second USENIX Conf. on File and Storage Technologies, San Francisco, CA, April 2003.
12. S. Ghemawat, H. Gobioff, and S.T. Leung, The Google file system. In Proc. of the 19th ACM Symp. on Operating Systems Principles, pages 29-43, Bolton Landing, NY, October 2003.
13. S. D. Gribble, E. A. Brewer, J. M. Hellerstein, and D. Culler. Scalable, distributed data structures for internet service construction. In Proc. of the 4th USENIX Symp. on Operating Systems Design and Implementation, San Diego, CA, October 2000.
14. A. Haeberlen, A. Mislove, and P. Druschel. Glacier: Highly durable, decentralized storage despite massive correlated failures. In Proc. of the Second USENIX Symp. on Networked Systems Design and Implementation, pages 143-158, Boston, MA, May 2005.
15. IRCache. http://www.ircache.net.
16. J. Kangasharju, J. Roberts, and K. Ross. Object replication strategies in content distribution networks. In Proc. of the 6th Workshop on Web Caching and Content Distribution, Boston, MA, June 2001.
17. J.J. Kistler and M. Satyanarayanan. Disconnected operation in the Coda file system. ACM Trans. on Computer Systems, 10(1):3-25, February 1992.
18. J. Kubiatowicz, D. Bindel, Y. Chen, 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. In Proc. of the 9th Int'l Conf. on Architectural Support for Programming Languages and Operating Systems, pages 190-201, Cambridge, MA, November 2000.
19. S. Kullback and R. A. Leibler. On information and sufficiency. Annals of Mathematical Statistics, 22(1):79-86, 1951.
20. J.W. Mickens and B.D. Noble. Exploiting availability prediction in distributed systems. In Proc. of the Third USENIX Symp. on Networked Systems Design and Implementation, 2006.
21. S. Nath, H. Yu, P.B. Gibbons, and S. Seshan. Subtleties in tolerating correlated failures in wide-area storage systems. In Proc. of the Third USENIX Symp. on Networked Systems Design and Implementation, pages 225-238, San Jose, CA, May 2006.
22. D.A. Patterson, G. Gibson, and R.H. Katz. A case for redundant arrays of inexpensive disks (RAID). In Proc. of the ACM Int'l Conf. on Management of Data, pages 109-116, Chicago, IL, September 1988.
23. J. Plank. A tutorial on Reed-Solomon coding for fault-tolerance in RAID-like systems. Software Practice and Experience, 27(9):995-1012, September 1997.
24. V. Ramasubramanian and E. Sirer. Beehive: Exploiting power law query distributions for o(1) lookup performance in peer to peer overlays. In Proc. of the First USENIX Symp. on Networked Systems Design and Implementation, San Francisco, CA, March 2004.
25. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content-addressable network. In Proc. of the ACM SIGCOMM, pages 161-172, San Diego, CA, August 2001.
26. R.V. Renesse and F.B. Schneider. Chain replication for supporting high throughput and availability. In Proc. of the 6th USENIX Symp. on Operating Systems Design and Implementation, pages 91-104, San Francisco, CA, December 2004.
27. R. Rodrigues and B. Liskov. High availability in DHTs: Erasure coding vs. replication. In Proc. of the 4th Int'l Workshop on Peer-to-Peer Systems, Ithaca, NY, February 2005.
28. A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proc. of IFIP/ACM Middleware Conf., pages 329-350, Heidelberg, Germany, November 2001.
29. Y. Saito, B. N. Bershad, and H. M. Levy Manageability, availability, and performance in Porcupine: a highly scalable, cluster-based mail service. In Proc. of the 17th ACM Symp. on Operating Systems Principles, pages 1-15, Charleston, SC, December 1999.
30. K. Shen, H. Tang, T. Yang, and L. Chu. Integrated Resource Management for Cluster-based Internet Services. In Proc. of the 5th USENIX Symp. on Operating Systems Design and Implementation, pages 225-238, Boston, MA, December 2002.
31. K. Shen, T. Yang, and L. Chu. Clustering support and replication management for scalable network services. IEEE Trans. on Parallel and Distributed Systems, 14(11):1168-1179, November 2003.
32. K. Shen, T. Yang, L. Chu, J. L. Holliday, D. A. Kuschner, and H. Zhu. Neptune: Scalable replication management and programming support for cluster-based network services. In Proc. of the Third USENIX Symp. on Internet Technologies and Systems, pages 197-208, San Francisco, CA, March 2001.
33. SMART. ftp://ftp.cs.cornell.edu/pub/smart.
34. I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for Internet applications. In Proc. of the ACM SIGCOMM, pages 149-160, San Diego, CA, August 2001.
35. H. Weatherspoon and J.D. Kubiatowicz. Erasure coding vs. replication: A quantitative comparison. In Proc. of the First Int'l Workshop on Peer-to-Peer Systems, Cambridge, MA, March 2002.
36. H. Yu, P.B. Gibbons, and S. Nath. Availability of multi-object operations. In Proc. of the Third USENIX Symp. on Networked Systems Design and Implementation, pages 211-224, San Jose, CA, May 2006.
37. H. Yu and A. Vahdat. Minimal replication cost for availability. In Proc. of the 21st ACM Symp. on Principles of Distributed Computing, pages 98-107, Monterey, CA, July 2002.