1Honicky R J, Miller E L. A Fast Algorithm for Online Placement and Reorganization of Replicated Data[C]//Proc of IPDPS'03, 2003.
2Xin Q, Miller E L, Long D D E, et al. Reliability Mechanisms for Very Large Storage Systems[C]// Proc of MSST'03, 2003:146-156.
3Brinkmann A, Effert S, Heide F M A D, et al. Dynamic and Redundant Data Placement[C]//Proc of ICDCS'07, 2007:29.
4Karger D, Lehman E, Leighton T, et al. Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web[C]/// Proc of STOC'97, 1997:654-663.
5Brinkmann A, Salzwedel K, Scheideler C. Efficient, Distributed Data Placement Strategies for Storage Area Networks [C]//Proc of SPAA'00, 2000:119-128.
6Brinkmann A, Salzwedel K, Scheideler C. Compact, Adaptive Placement Schemes for Non-uniform Distribution Requirements[C]// Proc of SPAA'02, 2002:53-62.
7Schindelhauer C, Sehomaker G. Weighted Distributed Hash Tables[C]//Proc of SPAA'05, 2005 : 218-227.
8Honicky R J, Miller E L. Replication Under Scalable Hashing: A Family of Algorithms for Scalable Decentralized Data Distribution[C]//Proc of IPDPS'04, 2004: 96.
9Weil S A, Brandt S A, Miller E L, et al. CRUSH: Controlled, Scalable And Decentralized Placement of Replicated Data[C]// Proc of SC'06,2006 : 122.
10Xin Q, Schwarz T J E, Miller E L. Availability in Global Peer-to-peer Storage Systems[C]// Proc of the 6th Workshop on Distributed Data and Structures, 2004.
