Skip to Main Content
Memory allocation problem in information storage networks is studied in this paper. The memory allocation problem is a sub-problem of a file storage scheme, which bounds file-retrieving delays in a heterogeneous information network, under both fault-free and faulty circumstances. This paper also presents an algorithm of complexity O(q|V|3) which finds an optimal memory allocation for a tree network G=(V,E), where |V| is the number of vertices and q is the average cardinality of a requirement set.
Date of Conference: 29 June-4 July 2003