Department of Computer Engineering2024-11-1020169781-5090-0223-810.1109/NOMS.2016.75028282-s2.0-84979768763http://dx.doi.org/10.1109/NOMS.2016.7502828https://hdl.handle.net/20.500.14288/16613Skip Graph, a member of the distributed hash table (DHT) family, has several benefits as an underlying structure in peer-to-peer (P2P) storage systems. In such systems, replication plays a key role on the system's performance. The traditional decentralized replication algorithms do not consider the locations of Skip Graph nodes in the network. Negligence of node locations in the placement of the replicas results in high access delays between the nodes and their closest replicas. This negatively affects the performance of the whole storage system. In this paper, with the aim of making Skip Graph's replication locality aware, we propose dynamic fully decentralized LARAS approach, where the data owner can replicate itself based on the system size, possible data requester nodes' set and using local information of the storage system. Our extensive performance results show that LARAS improves replication access delay of the Skip Graph based storage system about 20% and 38% in comparison to the best known decentralized counterpart in the public and private replication scenarios, respectively.Computer scienceInformation systemsConference proceedinghttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84979768763&doi=10.1109%2fNOMS.2016.7502828&partnerID=40&md5=1fc14c9d6a4944f54e9ec2547c682c843898301000393586