Network File Storage With Graceful Performance Degradation
暂无分享,去创建一个
[1] Anxiao Jiang,et al. Optimal t-interleaving on tori , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..
[2] Lawrence W. Dowdy,et al. Comparative Models of the File Assignment Problem , 1982, CSUR.
[3] David B. Shmoys,et al. A Best Possible Heuristic for the k-Center Problem , 1985, Math. Oper. Res..
[4] O. Kariv,et al. An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .
[5] Peter J. Slater,et al. R-Domination in Graphs , 1976, J. ACM.
[6] Jehoshua Bruck,et al. Multi-Cluster interleaving in linear arrays and rings , 2003 .
[7] Randy H. Katz,et al. A case for redundant arrays of inexpensive disks (RAID) , 1988, SIGMOD '88.
[8] S. L. HAKIMIt. AN ALGORITHMIC APPROACH TO NETWORK LOCATION PROBLEMS. , 1979 .
[9] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[10] J. Spruce Riordon,et al. Optimal allocation of resources in distributed information networks , 1976, TODS.
[11] Anxiao Jiang,et al. Memory allocation in information storage networks , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..
[12] Moni Naor,et al. Optimal File Sharing in Distributed Networks , 1995, SIAM J. Comput..
[13] Allan Borodin,et al. Online computation and competitive analysis , 1998 .
[14] Jia Wang,et al. A survey of web caching schemes for the Internet , 1999, CCRV.
[15] Konstantinos Kalpakis,et al. Optimal Placement of Replicas in Trees with Read, Write, and Storage Costs , 2001, IEEE Trans. Parallel Distributed Syst..
[16] William E. Johnston,et al. Coding for High Availability of a Distributed-Parallel Storage System , 1998, IEEE Trans. Parallel Distributed Syst..