STORAGE ALGORITHM FOR UNSTRUCTURED PEER-TO-PEER NETWORKS
Fatma Elarabi, Aya Aboelkhair, Alaa Mohammed, Ehab Morsy
Department of Mathematics, Suez Canal University, Ismailia 41522, Egypt
Keywords: Distributed Systems, Distributed Algorithms, Peer-to-Peer Net-works, Distributed Storage Systems
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.
© 2016 The Author(s). This open access article is distributed under a Creative Commons Attribution (CC-BY) 4.0 license.
You are free to:
Share — copy and redistribute the material in any medium or format
Adapt — remix, transform, and build upon the material for any purpose, even commercially.
The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
Attribution — You must give appropriate credit, provide a link to the license, and indicate if changes were made.
You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
No additional restrictions
You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits