P2P Storage Systems
|has title::Placement Strategies For P2P Storage Systems|
|Master:||project within::Parallel and Distributed Computer Systems|
|Student name:||student name::Abhishek Kumar Singh|
|Supervisor:||Guillaume Pierre, Ernst Biersack|
|Second reader:||has second reader::Maarten Van Steen|
The goal of the thesis is to identify the optimal placement strategy that places pieces on peers such that the data can be stored reliably and maximizes the amount of stored data. The redundancy scheme that we are interested in is the erasure coding. In a large network, there exists peers which have different availability ratios and have different availability pattern. We aim to exploit this to reliably store as much data as possible. The thesis aims to provide some theoretical insights in the problem and provide an optimal strategy through experiments.