Search with index replication in power-law like peer-to-peer networks

Many unstructured peer-to-peer applications exhibit a characteristic of complex networks, such as power-law degree distribution. We are motivated by the fact that the high degree nodes are well connected each other and design a novel cluster-based search protocol to take advantage of c1uster-based index replication. The search success rate is improved by one order of magnitude and the index storage cost is reduced by almost one order of magnitude either. We also study the search performance through theoretical model and give the mathematical relationship between search performance and cluster threshold c. We further evaluate the cluster-based techniques by simulator-based experiments and the results prove the rightness of our mathematic analysis.