File allocation involving worst case response times and link capacities: model and solution procedure

A file allocation problem model that minimizes cost file allocation is presented. Moreover, this model assures that in the worst case, response time for each query is feasible, and this results in a 0/1 integer programming problem. Then, a Lagrangian relaxation-based algorithm is developed and tested on several classes of problems. Results show that the model, in conjunction with the solution procedure, is accurate and efficient.