Abstract
A file storage scheme is proposed for networks containing heterogeneous clients. In the scheme, the performance measured by file-retrieval delays degrades gracefully under increasingly serious faulty circumstances. The scheme combines coding with storage for better performance. The problem is NP-hard for general networks; and this article focuses on tree networks with asymmetric edges between adjacent nodes. A polynomial-time memory-allocation algorithm is presented, which determines how much data to store on each node, with the objective of minimizing the total amount of data stored in the network. Then a polynomial-time data-interleaving algorithm is used to determine which data to store on each node for satisfying the quality-of-service requirements in the scheme. By combining the memory-allocation algorithm with the data-interleaving algorithm, an optimal solution to realize the file storage scheme in tree networks is established.
- Borodin, A. and El-Yaniv, R. 1998. Online Computation and Competitive Analysis. Cambridge University Press, Cambridge, U.K. Google Scholar
Digital Library
- Dowdy, L. W. and Foster, D. V. 1982. Comparative models of the file assignment problem. ACM Comput. Surv. 14, 2, 287--313. Google Scholar
Digital Library
- Garey, M. R. and Johnson, D. S. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York, NY, and San Francisco, CA. Google Scholar
Digital Library
- Hochbaum, D. S. and Shmoys, D. B. 1985. A best possible heuristic for the k-center problem. Math. Operat. Res. 10, 2, 180--184.Google Scholar
Digital Library
- Jiang, A. and Bruck, J. 2003a. Diversity coloring for distributed data storage in networks. Unpublished manuscript.Google Scholar
- Jiang, A. and Bruck, J. 2003b. Memory allocation in information storage networks. In Proceedings of the IEEE International Symposium on Information Theory, (Tokohama, Japan). 453.Google Scholar
- Jiang, A. and Bruck, J. 2005. Multicluster interleaving on linear paths and cycles. IEEE Trans. Inform. Theory 51, 2 (Feb.), 597--611. Google Scholar
Digital Library
- Jiang, A., Cook, M., and Bruck, J. 2004. Optimal t-interleaving on tori. In Proceedings of the IEEE International Symposium on Information Theory (Chicago, IL). 22.Google Scholar
- Kalpakis, K., Dasgupta, K., and Wolfson, O. 2001. Optimal placement of replicas in trees with read, write, and storage costs. IEEE Trans. Parallel Distrib. Syst. 12, 6 (June), 628--637. Google Scholar
Digital Library
- Kariv, O. and Hakimi, S. L. 1979. An algorithmic approach to network location problems. I: The p-centers. SIAM J. Appl. Math. 37, 3 (Dec.), 513--538.Google Scholar
- Mahmoud, S. and Riordan, J. S. 1976. Optimal allocation of resources in distributed information networks. ACM Trans. Database Syst. 1, 66--78. Google Scholar
Digital Library
- Malluhi, Q. M. and Johnston, W. E. 1998. Coding for high availability of a distributed-parallel storage system. IEEE Trans. Parallel Distrib. Syst. 9, 12 (Dec.), 1237--1252. Google Scholar
Digital Library
- Naor, M. and Roth, R. M. 1995. Optimal file sharing in distributed networks. SIAM J. Comput. 24, 1, 158--183. Google Scholar
Digital Library
- Patterson, D. A., Gibson, G. A., and Katz, R. 1988. A case for redundant arrays of inexpensive disks. In Proceedings of the SIGMOD International Conference on Data Management. 109--116. Google Scholar
Digital Library
- Slater, P. J. 1976. R-domination in graphs. J. Assoc. Comput. Mach. 23, 3 (March), 446--450. Google Scholar
Digital Library
- Wang, J. 1999. A survey of Web caching schemes for the Internet. ACM SIGCOMM Comput. Comm. Rev. 29, 5, 36--46. Google Scholar
Digital Library
Index Terms
Network file storage with graceful performance degradation
Recommendations
Fault-tolerant disk storage and file systems using reflective memory
HICSS '95: Proceedings of the 28th Hawaii International Conference on System SciencesMost replicated storage and file systems either take a specialized hardware approach or a software-oriented approach to fault tolerance. The paper describes a fault-tolerant disk storage and file system that falls in between the hardware and software ...






Comments