By Topic

Memory allocation in information storage networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Anxiao Jiang ; Dept. of Electr. Eng., California Inst. of Technol., Pasadena, CA, USA ; Bruck, J.

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.

Published in:

Information Theory, 2003. Proceedings. IEEE International Symposium on

Date of Conference:

29 June-4 July 2003