Interlocal: Tutarlılık ve replikasyon garantili yerel gorevdes depolama sistemi

Trend in computer storage flows from possessing data locally to data outsourcing. Although users tend to store data at cloud or peer-to-peer storage systems, they also require guarantees about the security of data. A key requirement is the ability to check integrity of the files without downloading them and make necessary updates. In case of peer-to-peer storage systems, it is also desirable to place files at the nodes physically close to the data owner for minimal response time and effi cient access. In the first part of this thesis, we implement and examine a system based on Dynamic Provable Data Possession (DPDP) model. We present an optimized data structure based on skip lists called FlexList and its advantages over other data structures. We then propose FlexDPDP: a complete dynamic provable data possession system employing FlexList. Furthermore, we develop optimized algorithms for FlexDPDP operations and analyze the effi ciency gains in terms of time, size and energy. In the second part of this thesis, we propose and evaluate InterLocal, a novel integrity and replication guaranteed locality-based peer-to-peer storage system. We employ a skip graph as the underlying overlay structure, and use landmark multidimensional scaling for peer locality calculation, on the top of FlexDPDP at each node to provide data integrity. We implement both a regular skip graph based storage system and InterLocal, and evaluate their performance on the PlanetLab under various scenarios. We obtain 3x speed up in terms of le access by providing InterLocal, and a gradual performance decrease in case of replica failures, having a worst-case performance that is equal to that of a regular skip graph based storage system.