Abstract

In this paper, we consider the problem of storage and search in peer-to-peer networks. It is well known that all storage systems try to meet two conflict goals, increasing the success rate within reasonable response time and decreasing the worst case message complexity. In this result, we focus on designing an e?cient algorithms for storage and search in unstructured peer-to-peer networks. In the storage, we present an algorithm for storage in which we try to maintain a reasonable number of copies of each file such that these copies can be reached in almost the same time from all nodes. In the search algorithm, we initiate a reasonable number of messages from the node that requests the file such that they cover random parts of the system. We evaluate our algorithm by applying it to random networks with various sizes.