Abstract: Replicating techniques are frequently used in a high performance distributed system to reduce the load of the overload nodes. Traditional file replication algorithms rely on the analysis of client-access logs to determine the location of the replicated nodes. This paper presents a fault-tolerant BitwiseTree model for peer to peer system. It constructs a replication tree for each node, and then uses bitwise operations to determine the location of the replicated node without any client-access history. In addition, each replication is guaranteed to reduce the workload of the replicating node by half. The experimental results show that BitwiseTree successfully and efficiently reduces the load of overloaded nodes.