Cloud solutions :
External hard drive solutions :
The Solution :
Main issues :
Data availability
a : peer availability (probability to be online)
s : number of data fragments on the server
p(s) : number of fragments stored on peers for a successful backup.
k : total number of data fragments
p(s) is optimized to guarantee a good data availability depending on a, k, s
Bandwidth allocation
restore crashed nodes > backup new fragments
(critical)
fragments close to completion are prioritized
Opportunistic or pessimistic strategies :
example of data maintenance.
Bandwidth allocation
Example of Data Maintenance :
Successful Backup condition : x ≥ p(s)
Optimization phase : reducing servers' load
Successful Backup condition : x ≥ p(s)
Servers are temporary storage.
Data Placement
Random :
The fragment is stored to a random peer that doesn't already have a fragment from the same peer.
Symmetric Selective :
Peers are divided into clusters, one can only store a fragment on a peer within the same cluster and if reciprocity is respected.