The algorithm considers the replica placement in real world P2P networks as a clustered K center problem which is NP complete. It is an efficient approximation algorithm which can work with several orders of magnitude faster than optimal solutions with minimum access latency.