OLIVEIRA, M. I. S.; http://lattes.cnpq.br/2328386382232459; OLIVEIRA, Marcelo Iury de Sousa.
Resumo:
Computers help our fives and allow us to store information digitally. With this greater
digitization of our lives comes the greater possibility of a catastrophic loss. A solution to
prevent data loss is to backup data. Since the capacities of modern hard disks have outgrown
the needs o f many users, leaving them with much idle storage space, we could use this space
of idle storage for the accomplishment of backups. There are several proposals of peer-to-peer
(P2P) systems that exploit unused storage space to backup data. Naturally, every time a peer
leaves permanently the system, all data stored by it need to be transferred to another peer,
preserving, thus, the redundancy of data of backup. The problem is that the rate of permanent
departures of existing P2P systems suggests that the amount of bandwidth necessary to keep
the redundancy of backup is greater than the current existing bandwidth. This work presents a
solution for this problem. The basic idea that we explore is that social network-based P2P
system will, by its nature, have rate of permanent departures so much lower of that current
P2P backup systems (which peers are anonymous), allowing the feasibility of P2P backup
systems.