Network File Storage With Graceful Performance Degradation

Jiang, Anxiao (Andrew) and Bruck, Jehosua (2004) Network File Storage With Graceful Performance Degradation. Technical Report. California Institute of Technology, Pasadena, CA. [CaltechPARADISE:2004.ETR061]

Full text available as:

PDF - Requires Adobe Acrobat Reader or other PDF viewer.

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 paper 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.

EPrint Type:	Monograph (Technical Report)
Additional Information:	Alternate URL: http://www.paradise.caltech.edu/papers/etr061.pdf
Uncontrolled Keywords:	Algorithms, Performance, Reliability, Theory Domination, file assignment, interleaving, memory allocation, fault tolerance
Subjects:	All Records
ID Code:	88
Deposited By:	Jehoshua Bruck
Deposited On:	15 November 2004
Record Number:	CaltechPARADISE:2004.ETR061
Official Persistent URL:	http://resolver.caltech.edu/CaltechPARADISE:2004.ETR061
Usage Policy:	You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format

Archive Staff Only: edit this record