Research on a butterfly-type model of P2P storage

Author

Zhi-Yu, Yang

Author_Institution

Sch. of Inf. Sci. & Eng., Hunan Univ., Changsha, China

fYear

2011

fDate

16-18 Dec. 2011

Firstpage

1619

Lastpage

1622

Abstract

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.

Keywords

Internet; hypercube networks; peer-to-peer computing; storage management; Internet; P2P algorithm; P2P distributed-storage model; SF-DHT algorithm; SF-STORE; SF-STORE architecture mode; SF-STORE central node; butterfly network architecture; butterfly-type model; distributed hash table; distributed-storage idea; eMule P2P storage system; positioning accuracy; positioning time; routing delay; Accuracy; Algorithm design and analysis; Bandwidth; Internet; Network topology; Routing; Testing; DHT; P2P network; distributed-storage; network storage;

fLanguage

English

Publisher

ieee

Conference_Titel

Transportation, Mechanical, and Electrical Engineering (TMEE), 2011 International Conference on

Conference_Location

Changchun

Print_ISBN

978-1-4577-1700-0

Type

conf

DOI

10.1109/TMEE.2011.6199520

Filename

6199520