Network file storage with graceful performance degradation
- Creators
- Jiang, Anxiao (Andrew)
- Bruck, Jehoshua
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.
Additional Information
© 2005 ACM. Received August 2004; revised September 2004; accepted September 2004 This work was supported in part by the Lee Center for Advanced Networking at the California Institute of Technology, and by NSF grant CCR-TC-0208975.Additional details
- Eprint ID
- 71789
- DOI
- 10.1145/1063786.1063788
- Resolver ID
- CaltechAUTHORS:20161107-163620734
- Caltech Lee Center for Advanced Networking
- CCR-TC-0208975
- NSF
- Created
-
2016-11-08Created from EPrint's datestamp field
- Updated
-
2021-11-11Created from EPrint's last_modified field