Network file storage with graceful performance degradation

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.

[1]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[2]  Jehoshua Bruck,et al.  Multi-Cluster interleaving in linear arrays and rings , 2003 .

[3]  O. Kariv,et al.  An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .

[4]  David B. Shmoys,et al.  A Best Possible Heuristic for the k-Center Problem , 1985, Math. Oper. Res..

[5]  Peter J. Slater,et al.  R-Domination in Graphs , 1976, J. ACM.

[6]  O. Kariv,et al.  An Algorithmic Approach to Network Location Problems. I: The p-Centers , 1979 .

[7]  Anxiao Jiang,et al.  Memory allocation in information storage networks , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[8]  Randy H. Katz,et al.  A case for redundant arrays of inexpensive disks (RAID) , 1988, SIGMOD '88.

[9]  Lawrence W. Dowdy,et al.  Comparative Models of the File Assignment Problem , 1982, CSUR.

[10]  Anxiao Jiang,et al.  Multicluster interleaving on paths and cycles , 2005, IEEE Transactions on Information Theory.

[11]  Anxiao Jiang,et al.  Diversity Coloring for Distributed Data Storage in Networks1 , 2005 .

[12]  William E. Johnston,et al.  Coding for High Availability of a Distributed-Parallel Storage System , 1998, IEEE Trans. Parallel Distributed Syst..

[13]  Moni Naor,et al.  Optimal File Sharing in Distributed Networks , 1995, SIAM J. Comput..

[14]  J. Spruce Riordon,et al.  Optimal allocation of resources in distributed information networks , 1976, TODS.

[15]  Konstantinos Kalpakis,et al.  Optimal Placement of Replicas in Trees with Read, Write, and Storage Costs , 2001, IEEE Trans. Parallel Distributed Syst..

[16]  Anxiao Jiang,et al.  Optimal t-interleaving on tori , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[17]  Anxiao.  Network File Storage With Graceful Performance Degradation , 2005 .

[18]  H KatzRandy,et al.  A case for redundant arrays of inexpensive disks (RAID) , 1988 .

[19]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[20]  Jia Wang,et al.  A survey of web caching schemes for the Internet , 1999, CCRV.

[21]  S. L. HAKIMIt.  AN ALGORITHMIC APPROACH TO NETWORK LOCATION PROBLEMS. , 1979 .