A novel greedy heuristic placement algorithm in distributed cooperative proxy systems

We investigate the object placement problem in distributed cooperative proxy systems and build a mathematics model. We prove that the problem is a NP-hard problem and a novel greedy heuristic placement algorithm (GHPA) is proposed to get the near-optimal answer in a polynomial complexity. We perform simulation and the results reported in the paper show that the GHPA algorithm could achieve better performance than the traditional MFU algorithm in both relative placement cost and the load balance. In general, the technology proposed could be used to develop effective distributed cooperative proxy systems such as CDSP, digital libraries and so on.