In this work we tackle the problem of on-line backup with a peer-to-peer approach. In contrast to current peer-to-peer architectures that build upon distributed hash-tables, we investigate whether an un-coordinated approach to data placement would prove effective in providing embedded incentives for users to offer local resources to the system. By modeling peers as sel sh entities striving for minimizing their cost in participating to the system, we analyze equilibrium topologies that materialize from the process of peer selection, whereby peers establish bi-lateral links that involve storing data in a symmetric way. System stratication, that is the emergence of clusters gathering peers with similar contribution efforts, is an essential outcome of the peer selection process: peers are lured to improve the \quality" of local resources they provide to access clusters with lower operational costs. Our results are corroborated by a numerical evaluation of the system that builds upon a polynomial-time best-response algorithm to the sel sh neighbor selection game.
Selfish neighbor selection in peer-to-peer backup and storage applications
EURO-PAR 2009, 15th International Conference on Parallel and Distributed Computing, August 25-28, 2009, Delft, The Nederlands / Also published in "Lecture Notes in Computer Science", Volume 5704/2009
© Springer. Personal use of this material is permitted. The definitive version of this paper was published in EURO-PAR 2009, 15th International Conference on Parallel and Distributed Computing, August 25-28, 2009, Delft, The Nederlands / Also published in "Lecture Notes in Computer Science", Volume 5704/2009 and is available at : http://dx.doi.org/10.1007/978-3-642-03869-3_52
PERMALINK : https://www.eurecom.fr/publication/2738