Brokering Algorithms for Composing Low Cost Distributed Storage Resources

Abstract In this paper we investigate the composition of cheap network storage resources to meet specific availability and capacity requirements. We show that the problem of finding the optimal composition for availability and price requirements can be reduced to the knapsack problem, and propose three techniques for efficiently finding approximate solutions. These include a dynamic programming algorithm, a heuristic and an genetic algorithm. The algorithms can be implemented on a broker that intermediates between buyers and sellers of storage resources. Finally, we show that a broker in an open storage market, using the combination of the three algorithms can more frequently meet user requests and lower the cost of requests that are met compared to a broker that simply matches single resources to requests.

• Type: Conference
• Year: 2007
• Where: PDPTA
• Authors: Jimmy Secretan, Malachi Lawson, Ladislau Bölöni
• Keywords: Cheap Network Storage, Distributed And Parallel Computing, Dynamic Programming Algorithm, PDPTA 2007, Storage Resources