File placement over a network using simulated annealing326741
Sandip Sen · 1994
The redundant allocation of files over a number of sites in a network to minimize the total transmission and access costs for queries and updates is known to be an NPcomplete problem even under a static schedule of transactions.As such, a number of heuristic solution techniques have been proposed in literature to address this problem.We propose a stochastic optimization technique, simulated annealing, to find sohltions for the tile placement problem.Our experiments verify that good solutions to the problem can be found using this algorithm in a reasonable amount of time.This allows for solving larger sized problems than can be done using most other heuristic techniques.