Research on a butterfly-type model of P2P storage

With the development of Internet, the information that stored in the Internet becomes more and more numerous and diversified. Based on the distributed-storage idea, this paper presents a P2P distributed-storage model-SF-STORE. In this paper, after analyzing the existing DHT algorithm, the author designs and achieves the SF-DHT, confirming a P2P algorithm which is based on the butterfly network architecture and devising the accession and existence of the SF-STORE´s central node. Meanwhile, it also tests the SF-STORE architecture mode. The experiment of the SF-STORE model is divided into positioning time, positioning accuracy and routing delay by comparing with the well-known eMule P2P storage system.