2019/07/27 by Yahya Hassanzadeh-Nazarabadi, Alptekın Küpçü, Hassanzadeh-Nazarabadi, Yahya +3
Computer Science · #Caching and Content Delivery #Peer-to-Peer Network Technologies #Opportunistic and Delay-Tolerant Networks
paper · pdf · doi:10.48550/arxiv.1907.11997
As a Distributed Hash Table (DHT), Skip Graph routing overlays are exploited\nin several peer-to-peer (P2P) services, including P2P cloud storage. The fully\ndecentralized replication algorithms that are applicable to the Skip\nGraph-based P2P cloud storage fail on improving the performance of the system\nwith respect to both the availability of replicas as well as their response\ntime. Additionally, they presume the system as homogeneous with respect to the\nnodes' latency distribution, availability behavior, bandwidth, or storage. In\nthis paper, we propose Pyramid, which is the first fully decentralized utility-\nand locality-aware replication approach for Skip Graph-based P2P cloud storage\nsystems. Pyramid considers the nodes as heterogeneous with respect to their\nlatency distribution, availability behavior, bandwidth, and storage. Pyramid is\nutility-aware as it maximizes the average available bandwidth of replicas per\ntime slot (e.g., per hour). Additionally, Pyramid is locality-aware as it\nminimizes the average latency between nodes and their closest replica. Our\nsimulation results show that compared to the state-of-the-art solutions that\neither perform good in utility-awareness, or in locality-awareness, our\nproposed Pyramid improves both the utility- and locality-awareness of replicas\nwith a gain of about 1.2 and 1.1 times at the same time, respectively.\n