Constructing a Churned Peer-to-Peer Network for Efficient Search

As churn is an inherent character of a network. Researchers find it could bring down the performance of networks. We investigate this in another point of view, and find that searching one resource repeatedly can bring up search efficiency, though churn does bring down the performance for one time search. In this paper, we build a churned peer to peer network in which the connections are re-connected actively. The good aspect of churn is illustrated by using this churned network we construct. And then we make a mathematical analysis to model these network parameters and simulate to verify what we find.