Stochastic optimization of distributed database networks

An evaluation is made of three stochastic algorithms for the optimization of distributed database networks: a simple random search, an iterative random search, and simulated annealing. The primary goal of the optimization is to minimize the operating cost of the network while maintaining acceptable response times. The inputs to the problem include the number and locations of the network nodes, the number of distinct databases, the query and update traffic from each node to each database, and the various costs associated with installing and maintaining the network. The optimization routines must select the location and speed of communication links, the allocation of databases to nodes, and the paths for queries and updates. A maximum allowable time for a response to a query or update is also specified and serves as a constraint in the optimization process.<>