Issue No. 09 - September (2003 vol. 52)
<p><b>Abstract</b>—Random redundant data storage strategies have proven to be a good choice for efficient data storage in multimedia servers. These strategies lead to a retrieval problem in which it is decided for each requested data block which disk to use for its retrieval. In this paper, we give a complexity classification of retrieval problems for random redundant storage.</p>
Random redundant storage, load balancing, video servers, complexity analysis.
Frits Spieksma, Gerhard Woeginger, Joep Aerts, Jan Korst, Wim Verhaegh, "Random Redundant Storage in Disk Arrays: Complexity of Retrieval Problems", IEEE Transactions on Computers, vol. 52, no. , pp. 1210-1214, September 2003, doi:10.1109/TC.2003.1228515