A note on optimal allocation of files in a symmetric and homogeneous network

摘要

In this paper is shown that, when a computer network is homogeneous and symmetric, the problem of optimal allocation of files is not NP-complete. A method is presented by which the optimal allocation is obtained with at most n × m tries, where n is the number of computers of the network and m is the number of distinct files to be allocated.