Optimal file allocation problems for distributed data bases in unreliable computer networks

Moses Ma, Michael Athans · Defense Technical Information Center (DTIC) · 1982

This paper deals with the problem of optimally locating files, and their optimum number of redundant copies in a vulnerable communication network. It is assumed that each node and link of the communication network can fail independently. The optimization problem maximizes the probability that a commander can access the subset of files that he needs while minimizing the network-wide costs related to storage, query and update communication costs. The problem reduces to a linear zero-one integer programming one; several theorems that reduce its complexity of solution are presented. (Author)

Read the paper · More papers on PaperTik