点击次数：

论文类型：期刊论文

发表时间：2018-01-01

发表刊物：JOURNAL OF SUPERCOMPUTING

收录刊物：SCIE、EI、Scopus

卷号：74

期号：1

页面范围：183-204

ISSN号：0920-8542

关键字：Hybrid P2P network; Durable data storage; Super peer; Online time interval; Online probability; Generalized peer

摘要：Durable P2P data storage is a research focus in recent years. It aims at providing data for requesters anytime and anywhere. Considering the fact that any peer could join and leave P2P network freely and randomly, how to improve the data availability is a crucial issue when implementing a P2P data storage scheme. To guarantee data availability, data replication and replica management have been found as the effective strategies by distributing the replicas in different nodes. However, how to determine the data redundancy is a key issue which should be solved carefully. In this paper, according to the existing researches, we first calculate peers' online probabilities in each time interval, and then we group the peers which have the complementary online patterns to create the so-called generalized peers with high online probability in each time interval. With the created generalized peers, we present the durable P2P data storage scheme. The simulation results show that our P2P data storage scheme outperforms the existing strategies in terms of the data retrieval success rate and the response time in dynamic P2P networks.