Introspective failure analysis: Avoiding correlated failures in peer-to-peer systems

Proceedings of the IEEE Symposium on Reliable Distributed Systems

Volumn , Issue , 2002, Pages 362-367

  Weatherspoon, Hakim ^a   Moscovitz, Tal ^a   Kubiatowicz, John ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PEER-TO-PEER SYSTEMS;

ALGORITHMS; DATA ACQUISITION; FAILURE ANALYSIS; FAULT TOLERANT COMPUTER SYSTEMS; REAL TIME SYSTEMS; SERVERS;

NETWORK PROTOCOLS;

EID: 0036445057     PISSN: 10609857     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/RELDIS.2002.1180211     Document Type: Conference Paper

References (19)

1. Netcraft. http://www.netcraft.com/.
2. W. Bolosky, J. Douceur, D. Ely, and M. Theimer. Feasibility of a serverless distributed file system deployed on an existing set of desktop PCs. In Proc. of Sigmetrics, June 2000.
3. A. Butte and I. Kohane. Mutual information relevance networks: functional genomic clustering using pairwise entropy measurements. In Proc. of the Pacific Symposium on Biocomputing, 2000.
4. Y. Chen, J. Edler, A. Goldberg, A. Gottlieb, S. Sobti, and P. Yianilos. Prototype implementation of archival intermemory. In Proc. of IEEE ICDE, pages 485-495, Feb. 1996.
5. F. Dabek, M.F. Kaashoek, D. Karger, R. Morris, and I. Stoica. Wide-area cooperative storage with CFS. In Proc. of ACM SOSP, October 2001.
6. R. Dingledine, M. Freedman, and D. Molnar. The freehaven project: Distributed anonymous storage service. In Proc. of the Workshop on Design Issues in Anonymity and Unobservability, July 2000.
7. P. Druschel and A. Rowstron. Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. In Proc. of ACM SOSP, 2001.
8. K. Hildrum, J. Kubiatowicz, S. Rao, and B. Zhao. Distributed data location in a dynamic network. In Proc. of ACM SPAA, 2002.
9. S.C. Johnson. Challenges in evaluationg distributed algorithms. In Psychometrika, volume 32, pages 241-254, Sept 1967.
10. I. Keidar. Challenges in evaluationg distributed algorithms. In Proc. of International Workshop on Future Directions of Distributed Systems, 2002.
11. I. Keidar and K. Marzullo. The need for realistic failure models in protocol design. In Proc. of International Survivability Workshop, 2002.
12. J. Kubiatowicz et al. Oceanstore: An architecture for global-scale persistent storage. In Proc. of ASPLOS. ACM, 2000.
13. L. Lamport, R. Shostak, and M. Pease. The Byzantine Generals Problem. ACM TOPLAS, 4(3):382-401, 1982.
14. D. Oppenheimer and D.A. Patterson. Benchmarking large-scale internet services. June 2002. Submitted for publication to Workshop on Dependability Benchmarking.
15. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Schenker. A scalable content-addressable network. In Proceedings of SIGCOMM. ACM, August 2001.
16. S. Rhea, C. Wells, P. Eaton, D. Geels, B. Zhao, H. Weatherspoon, and J. Kubiatowicz. Maintenance free global storage in oceanstore. In Proc. of IEEE Internet Computing. IEEE, Sept. 2001.
17. J. Shi and J. Malik. Normalized cuts and image segmentation. In IEEE Transactions on Pattern Analysis and Machine Intelligence, volume 22, pages 888-905, 2000.
18. I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of SIGCOMM. ACM, August 2001.
19. H. Weatherspoon and J. Kubiatowicz. Erasure coding vs. replication: A quantitative comparison. In Proc. of IPTPS, 2002.