Decentralized and locality aware replication method for DHT-based P2P storage systems

作者：Hassanzadeh Nazarabadi Yahya; Kupcu Alptekin; Ozkasap Oznur^*

来源：Future Generation Computer Systems-The International Journal of eScience, 2018, 84: 32-46.

DOI：10.1016/j.future.2018.02.007

• Skip Graph
• Distributed hash table
• DHT
• P2P cloud storage
• Locality aware network for DHTs
• Replication

Skip Graph, a type of DHT, plays an important role in P2P cloud storage applications, where nodes publicly or privately store, share, and access data. Nowadays P2P storage systems are widely using replication to support data availability, reliability, and maintainability. With replication, the main consideration is determining peers to replicate the data. Traditional replication algorithms are partially randomized and employ rigid assumptions about nodes' distribution. This results in high access delay between nodes and their closest replicas, which degrades the system performance. We propose GLARAS, a dynamic and fully decentralized locality aware replication method for Skip Graph. In contrast to the traditional algorithms, which replicate based on strict assumptions about the distribution of nodes, GLARAS aims to approximate the underlying distribution by interacting with a very small subset of nodes and minimize the average access delay of replication accordingly. To ensure GLARAS performs at its best, we also propose a dynamic fully decentralized landmark-based locality aware name ID assignment namely LANS. This ensures that the nodes' distances in the overlay and the underlying network are consistent with each other. Our extensive experiments and analysis results demonstrate that compared to the best existing decentralized locality aware replication, GLARAS improves the average access delay of public and private replications by about 13% and 17%, respectively. Likewise, in comparison to the best existing decentralized locality aware name ID assignment, LANS improves the locality awareness of name IDs and the end-to-end latency of search queries in Skip Graph with the gains of about 19% and 8%, respectively. The average replication's access delay of a Skip Graph-based P2P storage system that employs GLARAS and LANS has an improvement gain of about 2.7 over the best state-of-the-art algorithms. Since Skip Graph is a DHT, any other DHT-based P2P storage service would benefit from our solution.

• 出版日期2018-7