A Caltech Library Service

Network File Storage With Graceful Performance Degradation

Jiang, Anxiao (Andrew) and Bruck, Jehosua (2004) Network File Storage With Graceful Performance Degradation. California Institute of Technology , Pasadena, CA. (Unpublished)

See Usage Policy.


Use this Persistent URL to link to this item:


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.

Item Type:Report or Paper (Technical Report)
Related URLs:
URLURL TypeDescription
Bruck, Jehosua0000-0001-8474-0812
Group:Parallel and Distributed Systems Group
Subject Keywords:Algorithms, Performance, Reliability, Theory Domination, file assignment, interleaving, memory allocation, fault tolerance
Record Number:CaltechPARADISE:2004.ETR061
Persistent URL:
Usage Policy:You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format
ID Code:26092
Deposited By: Imported from CaltechPARADISE
Deposited On:15 Nov 2004
Last Modified:22 Nov 2019 09:58

Repository Staff Only: item control page