Results 1 
2 of
2
Network file storage with graceful performance degradation
 ACM Transactions on Storage
, 2005
"... A file storage scheme is proposed for networks containing heterogeneous clients. In the scheme, the performance measured by fileretrieval delays degrades gracefully under increasingly serious faulty circumstances. The scheme combines coding with storage for better performance. The problem is NPhar ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
A file storage scheme is proposed for networks containing heterogeneous clients. In the scheme, the performance measured by fileretrieval delays degrades gracefully under increasingly serious faulty circumstances. The scheme combines coding with storage for better performance. The problem is NPhard for general networks; and this paper focuses on tree networks with asymmetric edges between adjacent nodes. A polynomialtime memoryallocation 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 polynomialtime datainterleaving algorithm is used to determine which data to store on each node for satisfying the qualityofservice requirements in the scheme. By combining the memoryallocation algorithm with the datainterleaving algorithm, an optimal solution to realize the file storage scheme in tree networks is established.
unknown title
, 2003
"... Given a graph G = (V, E) whose edges have lengths, we denote the distance between two vertices u and v by d(u, v). For any vertex u ∈ V and any real number r, we define N(u, r) as the set of vertices within distance r from u. We study the ..."
Abstract
 Add to MetaCart
Given a graph G = (V, E) whose edges have lengths, we denote the distance between two vertices u and v by d(u, v). For any vertex u ∈ V and any real number r, we define N(u, r) as the set of vertices within distance r from u. We study the